| 2026 | Non-trivial Zero-Knowledge Implies One-Way Functions. | Suvradip Chakraborty, James Hulett, Dakshita Khurana, Kabir Tomer |
| 2026 | Playing Tag with Okamoto-Schnorr: Three-Move Pairing-Free Blind Signatures from DDH. | Rutchathon Chairattana-Apirom, Michael Reichle, Stefano Tessaro |
| 2026 | Tight Lattice-Based Signatures Without Trapdoors from Search LWE. | Rutchathon Chairattana-Apirom, Nico Dttling, Julian Loss, Stefano Tessaro, Benedikt Wagner |
| 2026 | On the Quantum Equivalence Between S| LWE > and ISIS. | Andr Chailloux, Paul Hermouet |
| 2026 | How to Encrypt with Random Reversible Circuits: Functional, Homomorphic and CCA-Secure. | Ran Canetti, Ji Luo, Yiding Zhang |
| 2026 | Anonymous Public-Key Quantum Money and Universally Verifiable Quantum Voting. | Alper akan, Vipul Goyal, Takashi Yamakawa |
| 2026 | Public-Key Quantum Fire and Key-Fire From Classical Oracles. | Alper akan, Vipul Goyal, Omri Shmueli |
| 2026 | How to Delete Without a Trace: Certified Deniability in a Quantum World. | Alper akan, Vipul Goyal, Justin Raizes |
| 2026 | Multi-copy Security in Quantum Cryptography and More. | Alper akan, Vipul Goyal, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa |
| 2026 | TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes. | Benedikt Bnz, Giacomo Fenzi, Ron D. Rothblum, William Wang |
| 2026 | Golden: Lightweight Non-interactive Distributed Key Generation. | Benedikt Bnz, Kevin Choi, Chelsea Komlo |
| 2026 | One Pair to Rule Them All: Towards an Optimal Algorithm for Solving Code Equivalence via Codeword Search. | Alessandro Budroni, Andre Esser |
| 2026 | Halfspace Learning for Lattice Signature Key Recovery from Signs. | Marcus Brinkmann, Nicolai Kraus, Alexander May |
| 2026 | Succinct Two-Round Two-Party Signing from PCFs. | Lennart Braun, Geoffroy Couteau, Kelsey Melissaris, Mahshid Riahinia, Elahe Sadeghi |
| 2026 | On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem. | Zvika Brakerski, Henry Yuen |
| 2026 | Toward a Secure Fixed-Point Implementation of the Falcon Signature Scheme. | Daniel De Almeida Braga, Pierre-Alain Fouque, Bachir Lachguel, Thomas Prest |
| 2026 | Fast PCGs for Batch-Authenticated Multiplication Triples. | Elette Boyle, Niv Gilboa, Matan Hamilis, Yuval Ishai, Ariel Nof |
| 2026 | Dishonest-Majority Secure Computation via PIR-Authenticated Multiplication Triples. | Elette Boyle, Niv Gilboa, Matan Hamilis, Yuval Ishai, Ariel Nof |
| 2026 | Generic-Compatible Distinguishers for Linear Regression Based Attacks. | Sana Boussam |
| 2026 | The SQInstructor: a Guide to SQIsign and the Deuring Correspondence with Level Structures. | Giacomo Borin, Luca De Feo, Guido Maria Lido, Sina Schaeffler |
| 2026 | Efficient Batch Threshold Encryption Using Partial Fraction Techniques. | Dan Boneh, Rohit Nema, Arnab Roy, Ertem Nusret Tas |
| 2026 | Provable Security Analyses of Google's and Apple's Bluetooth Fast Pair Protocols. | Alexandra Boldyreva, Olga Sanina, Roy Stracovsky |
| 2026 | Orthus: Practical Sublinear Batch-Verification of Lattice Relations from Standard Assumptions. | Madalina Bolboceanu, Jonathan Bootle, Vadim Lyubashevsky, Antonio Merino-Gallardo, Gregor Seiler |
| 2026 | Quantumly Computing S-Unit Groups in Quantified Polynomial Time and Space. | Koen de Boer, Jol Felderhoff |
| 2026 | Data-Dependent Memory-Hard Functions: Sustained Space and Cumulative Complexity Trade-Offs in the Parallel Random Oracle Model. | Jeremiah Blocki, Blake Holman |