| 2022 | PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and More. | Rutchathon Chairattana-Apirom, Lucjan Hanzlik, Julian Loss, Anna Lysyanskaya, Benedikt Wagner |
| 2022 | The Gap Is Sensitive to Size of Preimages: Collapsing Property Doesn't Go Beyond Quantum Collision-Resistance for Preimages Bounded Hash Functions. | Shujiao Cao, Rui Xue |
| 2022 | Universally Composable End-to-End Secure Messaging. | Ran Canetti, Palak Jain, Marika Swanberg, Mayank Varia |
| 2022 | Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized Applications. | Federico Canale, Gregor Leander, Lukas Stennes |
| 2022 | Programmable Distributed Point Functions. | Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov |
| 2022 | Correlated Pseudorandomness from Expand-Accumulate Codes. | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl |
| 2022 | Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. | Katharina Boudgoust, Erell Gachon, Alice Pellet-Mary |
| 2022 | MuSig-L: Lattice-Based Multi-signature with Single-Round Online Phase. | Cecilia Boschini, Akira Takahashi, Mehdi Tibouchi |
| 2022 | Threshold Signatures with Private Accountability. | Dan Boneh, Chelsea Komlo |
| 2022 | On Codes and Learning with Errors over Function Fields. | Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard |
| 2022 | Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard Functions. | Jeremiah Blocki, Blake Holman |
| 2022 | Statistically Sender-Private OT from LPN and Derandomization. | Nir Bitansky, Sapir Freizeit |
| 2022 | Constructive Post-Quantum Reductions. | Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai |
| 2022 | A More Complete Analysis of the Signal Double Ratchet Algorithm. | Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman |
| 2022 | Differential Cryptanalysis in the Fixed-Key Model. | Tim Beyne, Vincent Rijmen |
| 2022 | Provably Secure Reflection Ciphers. | Tim Beyne, Yu Long Chen |
| 2022 | Breaking Rainbow Takes a Weekend on a Laptop. | Ward Beullens |
| 2022 | Better than Advertised Security for Non-interactive Threshold Signatures. | Mihir Bellare, Elizabeth C. Crites, Chelsea Komlo, Mary Maller, Stefano Tessaro, Chenzhi Zhu |
| 2022 | Constructing and Deconstructing Intentional Weaknesses in Symmetric Ciphers. | Christof Beierle, Tim Beyne, Patrick Felke, Gregor Leander |
| 2022 | Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$. | Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl |
| 2022 | Succinct Classical Verification of Quantum Computation. | James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang |
| 2022 | Superposition Meet-in-the-Middle Attacks: Updates on Fundamental Security of AES-like Hashing. | Zhenzhen Bao, Jian Guo, Danping Shi, Yi Tu |
| 2022 | (Nondeterministic) Hardness vs. Non-malleability. | Marshall Ball, Dana Dachman-Soled, Julian Loss |
| 2022 | Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow. | John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel |
| 2022 | On the Impossibility of Key Agreements from Quantum Random Oracles. | Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody |