| 2019 | Continuously Non-malleable Secret Sharing for General Access Structures. | Gianluca Brian, Antonio Faonio, Daniele Venturi |
| 2019 | (Pseudo) Random Quantum States with Binary Phase. | Zvika Brakerski, Omri Shmueli |
| 2019 | Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. | Zvika Brakerski, Nico Dttling, Sanjam Garg, Giulio Malavolta |
| 2019 | Permuted Puzzles and Cryptographic Hardness. | Elette Boyle, Justin Holmgren, Mor Weiss |
| 2019 | Secure Computation with Preprocessing via Function Secret Sharing. | Elette Boyle, Niv Gilboa, Yuval Ishai |
| 2019 | Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. | Erica Blum, Jonathan Katz, Julian Loss |
| 2019 | On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. | Nir Bitansky, Akshay Degwekar |
| 2019 | Tighter Proofs of CCA Security in the Quantum Random Oracle Model. | Nina Bindel, Mike Hamburg, Kathrin Hvelmanns, Andreas Hlsing, Edoardo Persichetti |
| 2019 | Statistical Difference Beyond the Polarizing Regime. | Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2019 | Linear-Size Constant-Query IOPs for Delegating Computation. | Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner |
| 2019 | On the (In)security of Kilian-Based SNARGs. | James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum |
| 2019 | Composable and Finite Computational Security of Quantum Message Transmission. | Fabio Banfi, Ueli Maurer, Christopher Portmann, Jiamin Zhu |
| 2019 | Is Information-Theoretic Topology-Hiding Computation Possible? | Marshall Ball, Elette Boyle, Ran Cohen, Tal Malkin, Tal Moran |
| 2019 | Optimal Bounded-Collusion Secure Functional Encryption. | Prabhanjan Ananth, Vinod Vaikuntanathan |
| 2019 | Fully Homomorphic NIZK and NIWI Proofs. | Prabhanjan Ananth, Apoorvaa Deshpande, Yael Tauman Kalai, Anna Lysyanskaya |
| 2019 | From FE Combiners to Secure MPC and Back. | Prabhanjan Ananth, Saikrishna Badrinarayanan, Aayush Jain, Nathan Manohar, Amit Sahai |
| 2019 | On Perfectly Secure 2PC in the OT-Hybrid Model. | Bar Alon, Anat Paskin-Cherniavsky |
| 2019 | Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank. | Josh Alman, Robin Hui |
| 2019 | Attribute Based Encryption for Deterministic Finite Automata from \mathsfDLIN. | Shweta Agrawal, Monosij Maitra, Shota Yamada |
| 2019 | Efficient Information-Theoretic Secure Multiparty Computation over Z/p | Mark Abspoel, Ronald Cramer, Ivan Damgrd, Daniel Escudero, Chen Yuan |
| 2019 | Efficient Private PEZ Protocols for Symmetric Functions. | Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta |
| 2018 | Impossibility of Order-Revealing Encryption in Idealized Models. | Mark Zhandry, Cong Zhang |
| 2018 | Is There an Oblivious RAM Lower Bound for Online Reads? | Mor Weiss, Daniel Wichs |
| 2018 | Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries. | Stefano Tessaro, Aishwarya Thiruvengadam |
| 2018 | Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. | Gil Segev, Ido Shahaf |