| 2026 | How to Use Polynomially-Hard iO: Turing Machine Obfuscation and More. | Jesko Dujmovic, Yao-Ching Hsieh, Abhishek Jain, Willy Quach |
| 2026 | Chosen Ciphertext Secure Pseudorandom Codes in the Standard Model. | Nico Dttling, Antoine Joux, Venkata Koppula, Mahesh Sreekumar Rajasree, Hendrik Waldner |
| 2026 | Breaking Optimized HQC: The First Cache-Timing Full Decryption Oracle Key-Recovery Attack in Post-quantum Cryptography. | Haiyue Dong, Qian Guo |
| 2026 | Linear Secret-Shared Shuffle with Malicious Security. | Samuel Dittmer, Rohit Nema, Rafail Ostrovsky |
| 2026 | On the Impossibility of Round-Optimal Pairing-Free Blind Signatures in the ROM. | Marian Dietz, Julia Kastner, Stefano Tessaro |
| 2026 | Bulletproofs are Optimal: Lower Bounds for Vector Commitments from Fiat-Shamir in Pairing-Free Groups. | Marian Dietz, Emanuele Giunta |
| 2026 | On the Distribution of the Distances of Random Words. | Benjamin E. Diamond, Angus Gruen |
| 2026 | Beyond Quadratic: Unlocking Pseudorandomness with Quartic Character. | Mriganka Dey, Sampa Dey, Sampurna Pal, Subhabrata Samajder, Rana Barua |
| 2026 | Feasibility of Broadcast with Dynamic Committees. | Gabriel Dettling, Chen-Da Liu-Zhang, Elisaweta Masserova, Matthieu Rambaud, Antoine Urban |
| 2026 | Expander Properties of Superspecial Isogeny Digraphs with Level Structure. | Thomas Decru, Krijn Reijnders |
| 2026 | Generic Committing Attacks - Zero-Padded Ascon is Less Secure than Expected. | Nilanjan Datta, Hrithik Nandi, Soumit Pal, Yu Sasaki, Patrick Struck, Maximiliane Weishupl |
| 2026 | Efficient Bootstrapping in Fully Homomorphic Encryption for Matrix Arithmetic. | Eric Crockett, Craig Gentry, Hyojun Kim, Yeongmin Lee, Yongwoo Lee |
| 2026 | On Reed-Solomon Proximity Gaps Conjectures. | Elizabeth C. Crites, Alistair Stewart |
| 2026 | Round-Optimal GUC-Secure Blind Signatures From Minimal Computational and Setup Assumptions - From Minimal Computational and Setup Assumptions. | Michele Ciampi, Pierpaolo Della Monica, Ivan Visconti |
| 2026 | On the Adaptive Security of Key-Unique Threshold Signatures. | Michele Ciampi, Elizabeth C. Crites, Chelsea Komlo, Mary Maller |
| 2026 | Constant-Rate Certified Deletion. | Kai-Min Chung, Tzu-Hsiang Huang, Wei-Hsiang Hung, Shota Yamada |
| 2026 | A Unified Treatment of Anamorphic Encryption. | Wonseok Choi, Daniel Collins, Xiangyu Liu, Roy Stracovsky, Vassilis Zikas |
| 2026 | On the Fiat-Shamir Security of Succinct Arguments from Functional Commitments. | Alessandro Chiesa, Ziyi Guan, Christian Knabenhans, Zihan Yu |
| 2026 | Fast Batch Matrix Multiplication in Ciphertexts. | Jung Hee Cheon, Minsik Kang, Junho Lee |
| 2026 | Algebraic Attack on Convolutional Neural Networks with Max Pooling. | Zirui Chen, Shi Tang, Zhengchao Gao, Yongjia Su, Lingyue Qin, Xiaoyang Dong |
| 2026 | Timed Commitments and Timed Encryption: Generic Constructions and Instantiations from Isogenies. | Mingjie Chen, Jonas Meers |
| 2026 | Learning with Alternating Moduli, Arora-Ge over Composite Moduli, and Weak PRFs. | Yilei Chen, Liheng Ji, Wenjie Li |
| 2026 | Collusion-Resistant Constrained PRFs for Compute- &-Compare Predicates from LWE. | Jiaqi Cheng, Rishab Goyal |
| 2026 | Three-Move Blind Signatures in Pairing-Free Groups. | Yanbo Chen |
| 2026 | Key Committing Security of HCTR2, Revisited. | Donghoon Chang, Yu Long Chen, Yukihito Hiraga, Kazuhiko Minematsu, Nicky Mouha, Yusuke Naito, Yu Sasaki, Takeshi Sugawara |