| 2026 | Cryptanalytic Extraction of Deep Neural Networks with Non-linear Activations. | Roderick Asselineau, Patrick Derbez, Pierre-Alain Fouque, Brice Minaud |
| 2026 | Pairing-Based SNARGs with Two Group Elements. | Gal Arnon, Jesko Dujmovic, Eylon Yogev |
| 2026 | On Arithmetic Private Information Retrieval: Why Code-Based PIR (Usually) Fails. | Benny Applebaum, Yuval Ishai, Shahar Shechter |
| 2026 | Security Amplification via Robust Indistinguishability Combiners. | Benny Applebaum, Nir Bitansky, Nathan Geier |
| 2026 | Efficient QC-MDPC Cryptosystems with Bounded Decoding Failure Rate. | Alessandro Annechini, Alessandro Barenghi, Gerardo Pelosi, Simone Perriello |
| 2026 | Less is More: On Copy Complexity in Quantum Cryptography. | Prabhanjan Ananth, Eli Goldin |
| 2026 | Lattice-Based Updatable KEM for Group Messaging. | Jol Alwen, Georg Fuchsbauer, Marta Mularczyk, Doreen Riepel |
| 2026 | Lower Bounds on Black-Box Constructions of Pseudorandom Functions. | Bar Alon, Itai Dinur, Muthuramakrishnan Venkitasubramaniam |
| 2026 | A Real-World Law-Enforcement Hack: The Case of Encrochat. | Martin R. Albrecht, Sunoo Park, Michael A. Specter, Douglas Stebila |
| 2026 | Hardness of Hinted ISIS from the Space-Time Hardness of Lattice Problems. | Martin R. Albrecht, Russell W. F. Lai, Eamonn W. Postlethwaite |
| 2026 | Post-quantum Public-Key Pseudorandom Correlation Functions for OT. | Shweta Agrawal, Kaartik Bhushan, Geoffroy Couteau, Mahshid Riahinia |
| 2026 | Fully-Succinct Multi-key FHE and Rate-1 Simulatable Threshold Decryption from LWE. | Abtin Afshar, Rishab Goyal |
| 2026 | Shorter Hash-Based Signatures Using Forced Pruning. | Mehdi Abri, Jonathan Katz |
| 2026 | Permissionless Consensus from a Common Random String. | Damiano Abram, Marshall Ball, Juan Garay, Aggelos Kiayias |
| 2025 | The Algebraic One-More MISIS Problem and Applications to Threshold Signatures. | Chenzhi Zhu, Stefano Tessaro |
| 2025 | Triangulating Meet-in-the-Middle Attack. | Boxin Zhao, Qingliang Hou, Lingyue Qin, Xiaoyang Dong |
| 2025 | How to Model Unitary Oracles. | Mark Zhandry |
| 2025 | Fully Homomorphic Encryption with Chosen-Ciphertext Security from LWE. | Rupeng Yang, Zuoxia Yu, Willy Susilo |
| 2025 | New Results on the φ-Hiding Assumption and Factoring Related RSA Moduli. | Jun Xu, Jun Song, Lei Hu |
| 2025 | Bitwise Garbling Schemes - A Model with 32λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\frac{3}{2}\lambda $$\end{document}-Bit Lower Bound of Ciphertexts. | Fei Xu, Honggang Hu, Changhong Xu |
| 2025 | Unbounded Distributed Broadcast Encryption and Registered ABE from Succinct LWE. | Hoeteck Wee, David J. Wu |
| 2025 | Functional Commitments and SNARGs for P/poly from SIS. | Hoeteck Wee |
| 2025 | A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for sfNP. | Brent Waters, David J. Wu |
| 2025 | How to Recover the Full Plaintext of XCB. | Peng Wang, Shuping Mao, Ruozhou Xu, Jiwu Jing, Yuewu Wang |
| 2025 | Leakage-Resilient Circuits Against sfNC1, Revisited. | Yuyu Wang |