| 2021 | An Algebraic Framework for Universal and Updatable SNARKs. | Carla Rfols, Arantxa Zapico |
| 2021 | Improved Torsion-Point Attacks on SIDH Variants. | Victoria de Quehen, Pter Kutas, Chris Leonardi, Chloe Martindale, Lorenz Panny, Christophe Petit, Katherine E. Stange |
| 2021 | Targeted Lossy Functions and Applications. | Willy Quach, Brent Waters, Daniel Wichs |
| 2021 | Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. | Arpita Patra, Akshayaram Srinivasan |
| 2021 | MuSig2: Simple Two-Round Schnorr Multi-signatures. | Jonas Nick, Tim Ruffing, Yannick Seurin |
| 2021 | How to Meet Ternary LWE Keys. | Alexander May |
| 2021 | Computational Hardness of Optimal Fair Computation: Beyond Minicrypt. | Hemanta K. Maji, Mingyuan Wang |
| 2021 | Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes. | Hemanta K. Maji, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang |
| 2021 | SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2021 | The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3. | Patrick Longa, Wen Wang, Jakub Szefer |
| 2021 | Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact. | Hanlin Liu, Yu Yu, Shuoyao Zhao, Jiang Zhang, Wenling Liu, Zhenkai Hu |
| 2021 | The t-wise Independence of Substitution-Permutation Networks. | Tianren Liu, Stefano Tessaro, Vinod Vaikuntanathan |
| 2021 | On the Possibility of Basing Cryptography on EXP≠ BPP. | Yanyi Liu, Rafael Pass |
| 2021 | Differential-Linear Cryptanalysis from an Algebraic Perspective. | Meicheng Liu, Xiaojuan Lu, Dongdai Lin |
| 2021 | Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques. | Fukang Liu, Takanori Isobe, Willi Meier |
| 2021 | Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs. | Xiao Liang, Omkant Pandey |
| 2021 | A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). | Ilan Komargodski, Wei-Kai Lin |
| 2021 | Lower Bounds on Lattice Sieving and Information Set Decoding. | Elena Kirshanova, Thijs Laarhoven |
| 2021 | Towards Faster Polynomial-Time Lattice Reduction. | Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque |
| 2021 | Improved Computational Extractors and Their Applications. | Dakshita Khurana, Akshayaram Srinivasan |
| 2021 | Composition with Knowledge Assumptions. | Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss |
| 2021 | A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs. | Shuichi Katsumata |
| 2021 | Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model. | Haim Kaplan, Yishay Mansour, Kobbi Nissim, Uri Stemmer |
| 2021 | Limits on the Adaptive Security of Yao's Garbling. | Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs |
| 2021 | On the Round Complexity of Black-Box Secure MPC. | Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan |