Some Papers for Final Projects

Reminder: all following papers are accessible through UVA online library, and you can search for the “authors’ version” that are open access. For recent papers that are published in conferences, you can often find video recordings of the talks. For example, if paper X is published in “Crypto 24”, you can find X in a session Y on the program of Crypto 24 and then find the session Y on Youtube.

• The Pseudorandom Oracle Model and Ideal Obfuscation. Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs.

  Indistinguishability obfuscation.

• A Note on Non-Interactive Zero-Knowledge from CDH. Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, Willy Quach. Crypto 2023.

  NIZK.

• Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions. Xinyu Mao, Noam Mazor, and Jiapeng Zhang. Eurocrypt 2023.

  It is needed to obtain signatures based on OWFs.

• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based. Craig Gentry, Amit Sahai, Brent Waters. Crypto 2013.

  Getting to know FHE.

• Foundations for Actively Secure Card-Based Cryptography. Alexander Koch, Stefan Walzer. FUN 2021.

  This can be a starting point for active / malicious security.

• Universal arguments and their applications. Boaz Barak and Oded Goldreich. SIAM J. Comput., 38(5):1661–1694, 2008.

• Notions of reducibility between cryptographic primitives. Omer Reingold, Luca Trevisan, and Salil Vadhan. TCC 2004.

  This is a good paper that revisits important black-box separations.

• An Unconditional Study of Computational Zero Knowledge. Salil P. Vadhan. FOCS 2004.

  A solid work on (statistical) ZK.

• On Hardness Amplification of One-Way Functions. Henry Lin, Luca Trevisan, and Hoeteck Wee. TCC 2005.

  The efficiency of hardness amplification.

• Extractors and Pseudorandom Generators. Luca Trevisan. STOC 1999.

  A break through in pseudorandomness (which is needed literally everywhere in crypto).