| 2020 | Quantum Encryption with Certified Deletion. | Anne Broadbent, Rabib Islam |
| 2020 | FHE-Based Bootstrapping of Designated-Prover NIZK. | Zvika Brakerski, Sanjam Garg, Rotem Tsabary |
| 2020 | Lossiness and Entropic Hardness for Ring-LWE. | Zvika Brakerski, Nico Dttling |
| 2020 | Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions. | Zvika Brakerski, Pedro Branco, Nico Dttling, Sanjam Garg, Giulio Malavolta |
| 2020 | Linear-Time Arguments with Sublinear Verification from Tensor Codes. | Jonathan Bootle, Alessandro Chiesa, Jens Groth |
| 2020 | Asynchronous Byzantine Agreement with Subquadratic Communication. | Erica Blum, Jonathan Katz, Chen-Da Liu-Zhang, Julian Loss |
| 2020 | Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. | Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni |
| 2020 | Weakly Extractable One-Way Functions. | Nir Bitansky, Noa Eizenstadt, Omer Paneth |
| 2020 | Characterizing Deterministic-Prover Zero Knowledge. | Nir Bitansky, Arka Rai Choudhuri |
| 2020 | On the Price of Concurrency in Group Ratcheting Protocols. | Alexander Bienstock, Yevgeniy Dodis, Paul Rsler |
| 2020 | Mr NISC: Multiparty Reusable Non-Interactive Secure Computation. | Fabrice Benhamouda, Huijia Lin |
| 2020 | Can a Public Blockchain Keep a Secret? | Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov, Shai Halevi, Hugo Krawczyk, Chengyu Lin, Tal Rabin, Leonid Reyzin |
| 2020 | On the Round Complexity of the Shuffle Model. | Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer |
| 2020 | The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. | Amos Beimel, Oriol Farrs |
| 2020 | Reusable Two-Round MPC from DDH. | James Bartusek, Sanjam Garg, Daniel Masny, Pratyay Mukherjee |
| 2020 | Topology-Hiding Communication from Minimal Assumptions. | Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran |
| 2020 | Universal Composition with Global Subroutines: Capturing Global Setup Within Plain UC. | Christian Badertscher, Ran Canetti, Julia Hesse, Bjrn Tackmann, Vassilis Zikas |
| 2020 | The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2020 | Secure Quantum Extraction Protocols. | Prabhanjan Ananth, Rolando L. La Placa |
| 2020 | Multi-key Fully-Homomorphic Encryption in the Plain Model. | Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta |
| 2020 | Continuous Group Key Agreement with Active Security. | Jol Alwen, Sandro Coretti, Daniel Jost, Marta Mularczyk |
| 2020 | On the Power of an Honest Majority in Three-Party Computation Without Broadcast. | Bar Alon, Ran Cohen, Eran Omri, Tom Suad |
| 2020 | Non-interactive Classical Verification of Quantum Computation. | Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, Shih-Han Hung |
| 2020 | On Pseudorandom Encodings. | Thomas Agrikola, Geoffroy Couteau, Yuval Ishai, Stanislaw Jarecki, Amit Sahai |
| 2020 | Optimal Broadcast Encryption from LWE and Pairings in the Standard Model. | Shweta Agrawal, Daniel Wichs, Shota Yamada |