Abstract is missing.
- Revisiting Cycles of Pairing-Friendly Elliptic CurvesMarta Bellés-Muñoz, Jorge Jiménez Urroz, Javier Silva 0001. 3-37 [doi]
- Non-interactive Zero-Knowledge from Non-interactive Batch ArgumentsJeffrey Champion, David J. Wu 0001. 38-71 [doi]
- Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract)Valerio Cini, Russell W. F. Lai, Giulio Malavolta. 72-105 [doi]
- Orbweaver: Succinct Linear Functional Commitments from LatticesBen Fisch, Zeyu Liu, Psi Vesely. 106-131 [doi]
- Non-interactive Universal ArgumentsNir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon. 132-158 [doi]
- Succinct Arguments for RAM Programs via Projection CodesYuval Ishai, Rafail Ostrovsky, Akash Shah. 159-192 [doi]
- Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CSAlexander Golovnev, Jonathan Lee 0003, Srinath T. V. Setty, Justin Thaler, Riad S. Wahby. 193-226 [doi]
- Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time VerificationJonathan Bootle, Alessandro Chiesa, Katerina Sotiraki. 227-251 [doi]
- SNARGs for Monotone Policy Batch NPZvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth. 252-283 [doi]
- TreePIR: Sublinear-Time and Polylog-Bandwidth Private Information Retrieval from DDHArthur Lazzaretti, Charalampos Papamanthou. 284-314 [doi]
- Multi-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPNQuang-Dao, Yuval Ishai, Aayush Jain, Huijia Lin. 315-348 [doi]
- Lattice Signature with Efficient Protocols, Application to Anonymous CredentialsCorentin Jeudy, Adeline Roux-Langlois, Olivier Sanders. 351-383 [doi]
- A Framework for Practical Anonymous Credentials from LatticesJonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen 0001, Alessandro Sorniotti. 384-417 [doi]
- Anonymous Tokens with Stronger Metadata Bit Hiding from Algebraic MACsMelissa Chase, F. Betül Durak, Serge Vaudenay. 418-449 [doi]
- Revisiting Time-Space Tradeoffs for Function InversionAlexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz. 453-481 [doi]
- The Query-Complexity of Preprocessing AttacksAshrujit Ghoshal, Stefano Tessaro. 482-513 [doi]
- Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-ResistanceYevgeniy Dodis, Niels Ferguson, Eli Goldin, Peter Hall, Krzysztof Pietrzak. 514-546 [doi]
- Individual CryptographyStefan Dziembowski, Sebastian Faust, Tomasz Lizurej. 547-579 [doi]
- Extractors: Low Entropy Requirements Colliding with Non-malleabilityDivesh Aggarwal, Eldon Chung, Maciej Obremski. 580-610 [doi]
- PAC Privacy: Automatic Privacy Measurement and Control of Data ProcessingHanshen Xiao, Srinivas Devadas. 611-644 [doi]
- One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable DistributionsYanyi Liu, Rafael Pass. 645-673 [doi]
- Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDMBrent Waters, Daniel Wichs. 674-693 [doi]
- Improved Multi-user Security Using the Squared-Ratio MethodYu Long Chen, Wonseok Choi 0002, Changmin Lee. 694-724 [doi]
- The Power of Undirected Rewindings for Adaptive SecurityDennis Hofheinz, Julia Kastner, Karen Klein. 725-758 [doi]
- Anamorphic Signatures: Secrecy from a Dictator Who Only Permits Authentication!Miroslaw Kutylowski, Giuseppe Persiano, Duong Hieu Phan, Moti Yung, Marcin Zawada. 759-790 [doi]