| 2026 | A Unifying Umbrella for Circular-Secure Cryptographic Primitives. | Fuyuki Kitagawa, Takahiro Matsuda |
| 2026 | A Unified Approach to Quantum Key Leasing with a Classical Lessor. | Fuyuki Kitagawa, Jiahui Liu, Shota Yamada, Takashi Yamakawa |
| 2026 | Cryptanalysis of Definite and Indefinite Lattice Isomorphism Problems with Applications to DEFI. | Markus Kirschmer, Cong Ling, Ali Sadreddin |
| 2026 | Asynchronous Lagrange-Based Threshold FHE with Smaller Modulus Overhead. | Won Kim, Changmin Lee, JeongHwan Lee, Alain Passelgue, Damien Stehl |
| 2026 | SIMD HSS and aHMAC from Interval Encoding with Application to One-Bit-Per-Gate Garbling. | Jaehyung Kim, Hanjun Li, Huijia Lin, Zeyu Liu |
| 2026 | Towards Practical Committee Sizes in YOSO MPC. | Pawel Kedzior, Marcin Mielniczuk, Daniele Venturi |
| 2026 | Statistically Secure Asynchronous MPC with Linear Communication and 풪(n | Xiaoyu Ji, Yifan Song |
| 2026 | Succinct Non-interactive Arguments for Distributions. | Zhengzhong Jin, Mingqi Lu, Bo Peng, Yue Yu |
| 2026 | Exploiting the Complexity of Lattice Isomorphism Problem via Irreducible Decomposition. | Kaijie Jiang, Yinchen Liu |
| 2026 | Incrementally Verifiable Computation Without Extraction. | Abhishek Jain, Surya Mathialagan, Brent Waters |
| 2026 | How Fast Does the Inverse Walk Approximate a Random Permutation? | Vishesh Jain, Tianren Liu, Clayton Mizgerd, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan |
| 2026 | New Techniques for Fast and Shallow FHE Bootstrapping and Beyond. | Aayush Jain, Huijia Lin, Zeyu Liu, Sagnik Saha |
| 2026 | Is the Hard-Label Cryptanalytic Model Extraction Really Polynomial? | Akira Ito, Takayuki Miura, Yosuke Todo |
| 2026 | Uncloneable Cryptography in Linear Quantum Memory. | Andrew Huang, Omri Shmueli, Vinod Vaikuntanathan, Mark Zhandry |
| 2026 | Careful with the Ring! Concrete Hardness Gaps Between LWE and MLWE. | Jianhua Hou, Haodong Jiang, Tabitha Ogilvie |
| 2026 | The Impossibility of Post-quantum Public Indifferentiability for Merkle-Damgrd. | Akinori Hosoyamada |
| 2026 | A Little LESS Secure - Side-Channel Attacks Exploiting Randomness Leakage. | Dina Hesse, Elisabeth Krahmer, Yi-Fu Lai, Jonas Meers |
| 2026 | Aborting Random Oracles: How to Build Them, How to Use Them. | Gottfried Herold, Dmitry Khovratovich, Mikhail A. Kudinov, Stefano Tessaro, Benedikt Wagner |
| 2026 | Distinguishing Goppa Codes Using Higher-Order Vanishing. | Tobias Hemmert, Andreas Wiemers |
| 2026 | Multiparty Computation with Minimal Overhead Without Circuit Transformation. | Aditya Hegde, Phuoc Pham Van Long, Mingyuan Wang |
| 2026 | Round-Optimal Black-Box MPC in the Plain Model from Minimal Assumptions. | Mohammad Hajiabadi, Ratnakar Medepalli, Akshayaram Srinivasan |
| 2026 | Generic-Group Barriers for Function-Hiding and Multi-input Functional Encryption. | Mohammad Hajiabadi, Roman Langrehr, Mingyuan Wang |
| 2026 | Maskaglia: A New, Efficient Approach to Masked Discrete Gaussian Sampling. | Calvin Abou Haidar, Thomas Espitau, Clment Hoffmann, Mehdi Tibouchi |
| 2026 | Bolt: Faster SNARKs from Sketched Codes. | Kobi Gurkan, Andrija Novakovic, Ron D. Rothblum |
| 2026 | Classical and Quantum Full Plaintext Recovery for Low-Round Feistel-Type Designs. | Tingting Guo, Peng Wang, Jiwu Jing, Shuping Mao, Gang Liu |