| 2020 | Batch Verification for Statistical Zero Knowledge Proofs. | Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan |
| 2020 | Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness. | Joseph Jaeger, Stefano Tessaro |
| 2020 | On Average-Case Hardness in TFNP from One-Way Functions. | Pavel Hubcek, Chethan Kamath, Karel Krl, Veronika Slvov |
| 2020 | On Computational Shortcuts for Information-Theoretic PIR. | Matthew M. Hong, Yuval Ishai, Victor I. Kolobov, Russell W. F. Lai |
| 2020 | Transparent Error Correcting in a Computationally Bounded World. | Ofer Grossman, Justin Holmgren, Eylon Yogev |
| 2020 | On Perfect Correctness in (Lockable) Obfuscation. | Rishab Goyal, Venkata Koppula, Satyanarayana Vusirikala, Brent Waters |
| 2020 | New Techniques in Replica Encodings with Client Setup. | Rachit Garg, George Lu, Brent Waters |
| 2020 | Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. | Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky |
| 2020 | Blockchains from Non-idealized Hash Functions. | Juan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos |
| 2020 | Ledger Combiners for Fast Settlement. | Matthias Fitzi, Peter Gazi, Aggelos Kiayias, Alexander Russell |
| 2020 | Secure Massively Parallel Computation for Dishonest Majority. | Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi |
| 2020 | Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries. | Serge Fehr, Chen Yuan |
| 2020 | Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity. | Yevgeniy Dodis, Pooya Farshim, Sogol Mazaheri, Stefano Tessaro |
| 2020 | Stronger Security and Constructions of Multi-designated Verifier Signatures. | Ivan Damgrd, Helene Haagh, Rebekah Mercer, Anca Nitulescu, Claudio Orlandi, Sophia Yakoubov |
| 2020 | Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures. | Dana Dachman-Soled |
| 2020 | On the Complexity of Arithmetic Secret Sharing. | Ronald Cramer, Chaoping Xing, Chen Yuan |
| 2020 | Round Optimal Secure Multiparty Computation from Minimal Assumptions. | Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky |
| 2020 | Barriers for Succinct Arguments in the Random Oracle Model. | Alessandro Chiesa, Eylon Yogev |
| 2020 | Classical Verification of Quantum Computations with Efficient Verifier. | Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa |
| 2020 | Lower Bounds on the Time/Memory Tradeoff of Function Inversion. | Dror Chawin, Iftach Haitner, Noam Mazor |
| 2020 | Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering. | Eshan Chattopadhyay, Xin Li |
| 2020 | A Lower Bound for One-Round Oblivious RAM. | David Cash, Andrew Drucker, Alexander Hoover |
| 2020 | A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity. | Ignacio Cascudo, Jaron Skovsted Gundersen |
| 2020 | Towards Multiparty Computation Withstanding Coercion of All Parties. | Ran Canetti, Oxana Poburinnaya |
| 2020 | Recursive Proof Composition from Accumulation Schemes. | Benedikt Bnz, Alessandro Chiesa, Pratyush Mishra, Nicholas Spooner |