| 2024 | From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking. | Lior Rotem, Gil Segev, Eylon Yogev |
| 2024 | Indistinguishability Obfuscation from Bilinear Maps and LPN Variants. | Seyoon Ragavan, Neekon Vafa, Vinod Vaikuntanathan |
| 2024 | Multi-client Attribute-Based and Predicate Encryption from Standard Assumptions. | David Pointcheval, Robert Schdlich |
| 2024 | Monotone Policy BARGs from BARGs and Additively Homomorphic Encryption. | Shafik Nassar, Brent Waters, David J. Wu |
| 2024 | Secure Computation with Parallel Calls to 2-Ary Functions. | Varun Narayanan, Shubham Vivek Pawar, Akshayaram Srinivasan |
| 2024 | Instance-Hiding Interactive Proofs - (Extended Abstract). | Changrui Mu, Prashant Nalini Vasudevan |
| 2024 | Bit Security: Optimal Adversaries, Equivalence Results, and a Toolbox for Computational-Statistical Security Analysis. | Daniele Micciancio, Mark Schultz-Wu |
| 2024 | Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2024 | Key-Homomorphic and Aggregate Verifiable Random Functions. | Giulio Malavolta |
| 2024 | Quantum Pseudorandom Scramblers. | Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, Mingnan Zhao |
| 2024 | Consensus in the Presence of Overlapping Faults and Total Omission. | Julian Loss, Kecheng Shi, Gilad Stern |
| 2024 | Composability in Watermarking Schemes. | Jiahui Liu, Mark Zhandry |
| 2024 | On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth. | Yanyi Liu, Rafael Pass |
| 2024 | On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols. | Ohad Klein, Ilan Komargodski, Chenzhi Zhu |
| 2024 | Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. | Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan |
| 2024 | An Improvement Upon the Bounds for the Local Leakage Resilience of Shamir's Secret Sharing Scheme. | Dustin Kasser |
| 2024 | Robust Combiners and Universal Constructions for Quantum Cryptography. | Taiga Hiroka, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa |
| 2024 | One-Way Functions and pKt Complexity. | Shuichi Hirahara, Zhenjian Lu, Igor C. Oliveira |
| 2024 | Tighter Adaptive IBEs and VRFs: Revisiting Waters' Artificial Abort. | Goichiro Hanaoka, Shuichi Katsumata, Kei Kimura, Kaoru Takemure, Shota Yamada |
| 2024 | On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption. | Mohammad Hajiabadi, Roman Langrehr, Adam O'Neill, Mingyuan Wang |
| 2024 | Sparse Linear Regression and Lattice Problems. | Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan |
| 2024 | Multi-authority Functional Encryption with Bounded Collusions from Standard Assumptions. | Rishab Goyal, Saikumar Yadugiri |
| 2024 | Unclonable Commitments and Proofs. | Vipul Goyal, Giulio Malavolta, Justin Raizes |
| 2024 | Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation. | Oriol Farrs, Miquel Guiot |
| 2024 | Space-Lock Puzzles and Verifiable Space-Hard Functions from Root-Finding in Sparse Polynomials. | Nico Dttling, Jesko Dujmovic, Antoine Joux |