| 2025 | On One-Shot Signatures, Quantum vs. Classical Binding, and Obfuscating Permutations. | Omri Shmueli, Mark Zhandry |
| 2025 | Straight-Line Knowledge Extraction for Multi-Round Protocols. | Lior Rotem, Stefano Tessaro |
| 2025 | Guess-and-Determine Rebound: Applications to Key Collisions on AES. | Lingyue Qin, Wenquan Bi, Xiaoyang Dong |
| 2025 | Unmasking TRaccoon: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort Protocol. | Rafal Del Pino, Shuichi Katsumata, Guilhem Niot, Michael Reichle, Kaoru Takemure |
| 2025 | Uncompressing Dilithium's Public Key. | Paco Azevedo Oliveira, Andersson Calle Viera, Benot Cogliati, Louis Goubin |
| 2025 | The Exact Multi-User Security of Key-Alternating Feistel Ciphers with a Single Permutation. | Yusuke Naito, Yu Sasaki, Takeshi Sugawara |
| 2025 | Quantum State Group Actions. | Saachi Mutreja, Mark Zhandry |
| 2025 | Exclusive Ownership of Fiat-Shamir Signatures: ML-DSA, SQIsign, LESS, and More. | Michael Meyer, Patrick Struck, Maximiliane Weishupl |
| 2025 | Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2025 | How to Tolerate Typos in Strong Asymmetric PAKE. | Ian McQuoid, Mike Rosulek, Jiayu Xu |
| 2025 | Key Recovery from Side-Channel Power Analysis Attacks on Non-SIMD HQC Decryption. | Nathan Maillet, Cyrius Nugier, Vincent Migliore, Jean-Christophe Deneuville |
| 2025 | How to Make Any Computational Secret Sharing Scheme Adaptively Secure. | George Lu, Brent Waters |
| 2025 | Efficient Pseudorandom Correlation Generators over $\mathbb {Z}/p^k\mathbb {Z}$. | Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan |
| 2025 | Authenticated BitGC for Actively Secure Rate-One 2PC. | Hanlin Liu, Xiao Wang, Kang Yang, Yu Yu |
| 2025 | Hardness Along the Boundary: Towards One-Way Functions from the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity. | Yanyi Liu, Rafael Pass |
| 2025 | On Witness Encryption and Laconic Zero-Knowledge Arguments. | Yanyi Liu, Noam Mazor, Rafael Pass |
| 2025 | Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication. | Junru Li, Yifan Song |
| 2025 | On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions. | Helger Lipmaa, Roberto Parisella, Janno Siim |
| 2025 | New Collision Attacks on Round-Reduced SHA-512. | Yingxin Li, Fukang Liu, Gaoli Wang, Haifeng Qian, Keting Jia, Xiangyu Kong |
| 2025 | Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size. | Seunghwan Lee, Jaesang Noh, Taejeong Kim, Dohyuk Kim, Dong-Joon Shin |
| 2025 | Stationary Syndrome Decoding for Improved PCGs. | Vladimir Kolesnikov, Stanislav Peceny, Srinivasan Raghuraman, Peter Rindal |
| 2025 | Blind Signatures from Proofs of Inequality. | Michael Kloo, Michael Reichle |
| 2025 | PKE and ABE with Collusion-Resistant Secure Key Leasing. | Fuyuki Kitagawa, Ryo Nishimaki, Nikhil Pappu |
| 2025 | How to Prove False Statements: Practical Attacks on Fiat-Shamir. | Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov |
| 2025 | At the Top of the Hypercube - Better Size-Time Tradeoffs for Hash-Based Signatures. | Dmitry Khovratovich, Mikhail A. Kudinov, Benedikt Wagner |