| 2026 | Navigating the Deep: End-to-End Extraction on Deep Neural Networks. | Haolin Liu, Adrien Siproudhis, Samuel Experton, Peter Lorenz, Christina Boura, Thomas Peyrin |
| 2026 | Updatable Private Set Intersection from Symmetric-Key Techniques. | Junxin Liu, Peihan Miao, Mike Rosulek, Xinyi Shi, Jifeng Wang |
| 2026 | Dimension-Reducing Algorithms for Quaternion Ideal-SVP. | Cong Ling, Andrew Mendelsohn, Christian Porter |
| 2026 | Succinct Garbled Circuits with Low-Depth Garbling Algorithms. | Hanjun Li, Huijia Lin, George Lu |
| 2026 | Putting Multi Into Multi-signatures: Tight Security for Multiple Signers. | Anja Lehmann, Cavit zbay |
| 2026 | Look Ahead! Practical CCA-Secure Steganography: Cover-Source Switching Meets Lattice Gaussian Sampling. | Russell W. F. Lai, Ivy K. Y. Woo, Hoover H. F. Yin |
| 2026 | Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs. | Erki Klaots, Helger Lipmaa, Roberto Parisella, Janno Siim |
| 2026 | OneTwoPAKE: Two-Round Strong Asymmetric PAKE with Ideal Security. | Yashvanth Kondi, Ian McQuoid, Kelsey Melissaris, Claudio Orlandi, Lawrence Roy, LaKyah Tyner |
| 2026 | Two-Party ECDSA Signing at Constant Communication Overhead. | Yashvanth Kondi |
| 2026 | Collusion-Resistant Quantum Secure Key Leasing Beyond Decryption. | Fuyuki Kitagawa, Ryo Nishimaki, Nikhil Pappu |
| 2026 | Cool + Cruel = Dual, and New Benchmarks for Sparse LWE. | Alexander Karenin, Elena Kirshanova, Julian Nowakowski, Eamonn W. Postlethwaite, Ludo N. Pulles, Fernando Virdia, Paul Vi |
| 2026 | Parallel Spooky Pebbling Makes Regev Factoring More Practical. | Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Katherine Van Kirk |
| 2026 | Partial Fraction Techniques for Cryptography. | Charanjit S. Jutla, Rohit Nema, Arnab Roy |
| 2026 | Perfectly Secure Network-Agnostic MPC Comes for Free. | Xiaoyu Ji, Chen-Da Liu-Zhang, Yifan Song |
| 2026 | Information-Theoretic Network-Agnostic MPC with Polynomial Communication. | Xiaoyu Ji, Chen-Da Liu-Zhang, Daniel Pllmann, Yifan Song |
| 2026 | Tweed: Adaptively Secure Lattice-Based Two-Round Threshold Signatures. | Kaijie Jiang, Stefano Tessaro, Hoeteck Wee, Chenzhi Zhu |
| 2026 | Lattice EPID with Efficient Revocation. | Corentin Jeudy, Olivier Sanders |
| 2026 | Secure Cloud Storage: Modularization, Network Adversaries and Adaptive Corruptions. | Jonas Janneck, Doreen Riepel |
| 2026 | Bird of Prey: Practical Signature Combiners Preserving Strong Unforgeability. | Jonas Janneck |
| 2026 | Non-interactive Secure Computation with Constant Communication Overhead. | Yuval Ishai, Ziyang Jin, Naty Peter, Akshayaram Srinivasan |
| 2026 | Round-Based Approximation of (Higher-Order) Differential-Linear Correlation - A Geometric Approach Perspective. | Kai Hu, Zhongfeng Niu, Meiqin Wang |
| 2026 | Two-Server Private Information Retrieval in Sublinear Time and Quasilinear Space. | Alexandra Henzinger, Seyoon Ragavan |
| 2026 | Jagged Polynomial Commitments (or: How to Stack Multilinears). | Tamir Hemo, Kevin Jue, Eugene Rabinovich, Gyumin Roh, Ron D. Rothblum |
| 2026 | Post-Quantum Blind Signature from Standard Group Action Assumptions and More. | Lucjan Hanzlik, Yi-Fu Lai, Eugenio Paracucchi, Edoardo Persichetti |
| 2026 | Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols. | Iftach Haitner, Nikolaos Makriyannis |