| 2025 | Obfuscating Pseudorandom Functions is Post-quantum Complete. | Pedro Branco, Abhishek Jain, Akshayaram Srinivasan |
| 2025 | A Hidden-Bits Approach to Statistical ZAPs from LWE. | Eli Bradley, George Lu, Shafik Nassar, Brent Waters, David J. Wu |
| 2025 | Provably Memory-Hard Proofs of Work with Memory-Easy Verification. | Jeremiah Blocki, Nathan Smearsoll |
| 2025 | Differentially Private Compression and the Sensitivity of LZ77. | Jeremiah Blocki, Seunghoon Lee, Brayan Sebastin Yepes Garcia |
| 2025 | SNARK Lower Bounds via Communication Complexity. | Rishabh Bhadauria, Alexander R. Block, Prantar Ghosh, Justin Thaler |
| 2025 | Incompressible Encryption with Everlasting Security. | Shany Ben-David, Eylon Yogev |
| 2025 | Cryptography with Weak Privacy. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Hanjun Li |
| 2025 | Polynomial Secret Sharing Schemes and Algebraic Matroids. | Amos Beimel, Oriol Farrs, Adriana Moya |
| 2025 | Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank. | Amik Raj Behera, Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2025 | Time-Space Trade-Offs for Sumcheck. | Anubhav Baweja, Alessandro Chiesa, Elisabetta Fedele, Giacomo Fenzi, Pratyush Mishra, Tushar Mopuri, Andrew Zitek-Estrada |
| 2025 | Relativized Succinct Arguments in the ROM do not Exist. | Annalisa Barbara, Alessandro Chiesa, Ziyi Guan |
| 2025 | Security Amplification of Threshold Signatures in the Standard Model. | Karen Azari, Cecilia Boschini, Kristina Hostkov, Michael Reichle |
| 2025 | Linear Prover IOPs in Log Star Rounds. | Noor Athamnah, Noga Ron-Zewi, Ron D. Rothblum |
| 2025 | On the Limitations of Pseudorandom Unitaries - Or: Cryptographic Applications of LOCC Indistinguishability of Identical Versus Independent Haar Unitaries. | Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin |
| 2025 | Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes. | Bar Alon, Amos Beimel, Or Lasri |
| 2025 | Zeroizing Attacks Against Evasive and Circular Evasive LWE. | Shweta Agrawal, Anuja Modi, Anshu Yadav, Shota Yamada |
| 2025 | Pseudorandom FE, iO and Applications. | Shweta Agrawal, Simran Kumari, Shota Yamada |
| 2025 | On Achieving "Best-in-the-Multiverse" MPC. | Anasuya Acharya, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2025 | Slightly Sublinear Trapdoor Hash Functions and PIR from Low-Noise LPN. | Damiano Abram, Giulio Malavolta, Lawrence Roy |
| 2025 | On the Impossibility of Actively Secure Distributed Samplers. | Damiano Abram, Serge Fehr, Maciej Obremski, Peter Scholl |
| 2024 | More Efficient Functional Bootstrapping for General Functions in Polynomial Modulus. | Han Xia, Feng-Hao Liu, Han Wang |
| 2024 | Adaptively Secure Attribute-Based Encryption from Witness Encryption. | Brent Waters, Daniel Wichs |
| 2024 | Bit-Security Preserving Hardness Amplification. | Shun Watanabe, Kenji Yasunaga |
| 2024 | Perfectly-Secure MPC with Constant Online Communication Complexity. | Yifan Song, Xiaxi Ye |
| 2024 | Information-Theoretic Multi-server Private Information Retrieval with Client Preprocessing. | Jaspal Singh, Yu Wei, Vassilis Zikas |