Abstract is missing.
- Lattice-Based Post-quantum iO from Circular Security with Random Opening AssumptionYao Ching Hsieh, Aayush Jain, Huijia Lin. 3-38 [doi]
- Lattice-Based Obfuscation from NTRU and Equivocal LWEValerio Cini, Russell W. F. Lai, Ivy K. Y. Woo. 39-72 [doi]
- Simple and General Counterexamples for Private-Coin Evasive LWENico Döttling, Abhishek Jain 0002, Giulio Malavolta, Surya Mathialagan, Vinod Vaikuntanathan. 73-92 [doi]
- Straight-Line Knowledge Extraction for Multi-Round ProtocolsLior Rotem, Stefano Tessaro. 95-127 [doi]
- Arc: Accumulation for Reed-Solomon CodesBenedikt Bünz, Pratyush Mishra, Wilson Nguyen, William Wang. 128-160 [doi]
- Breaking Verifiable Delay Functions in the Random Oracle ModelZiyi Guan, Artur Riazanov, Weiqiang Yuan 0002. 161-191 [doi]
- Designated-Verifier SNARGs with One Group ElementGal Arnon, Jesko Dujmovic, Yuval Ishai. 192-224 [doi]
- Universally Composable SNARKs with Transparent Setup without Programmable Random OracleChristian Badertscher, Matteo Campanelli, Michele Ciampi, Luigi Russo 0001, Luisa Siniscalchi. 225-258 [doi]
- sfZinc: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the IntegersAlbert Garreta, Hendrik Waldner, Ilia Vlasov, Katerina Hristova, Luca Dall'Ava, Marko Cupic, Matthew Klein. 259-291 [doi]
- A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for sfNPBrent Waters, David J. Wu 0001. 292-326 [doi]
- LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof SystemsDan Boneh, Binyi Chen. 327-361 [doi]
- On Knowledge-Soundness of Plonk in ROM from Falsifiable AssumptionsHelger Lipmaa, Roberto Parisella, Janno Siim. 362-395 [doi]
- Malicious Security in Collaborative zk-SNARKs: More than Meets the EyeSanjam Garg, Aarushi Goel, Abhishek Jain 0002, Bhaskar Roberts, Sruthi Sekar. 396-428 [doi]
- On Witness Encryption and Laconic Zero-Knowledge ArgumentsYanyi Liu, Noam Mazor, Rafael Pass. 429-461 [doi]
- NIZK Amplification via Leakage-Resilient Secure ComputationBenny Applebaum, Eliran Kachlon. 462-479 [doi]
- How to Share an NP Statement or Combiners for Zero-Knowledge ProofsBenny Applebaum, Eliran Kachlon. 480-513 [doi]
- Rate-1 Statistical Non-interactive Zero-KnowledgePedro Branco 0005, Nico Döttling, Akshayaram Srinivasan. 514-547 [doi]
- Zero-Knowledge in Streaming Interactive ProofsTomer Gewirtzman, Ron Rothblum. 548-579 [doi]
- On Weak NIZKs, One-Way Functions and AmplificationSuvradip Chakraborty, James Hulett, Dakshita Khurana. 580-610 [doi]
- Incrementally Verifiable Computation for NP from Standard AssumptionsPratish Datta, Abhishek Jain 0002, Zhengzhong Jin, Alexis Korb, Surya Mathialagan, Amit Sahai. 611-642 [doi]
- Verifiable Computation for Approximate Homomorphic Encryption SchemesIgnacio Cascudo, Anamaria Costache, Daniele Cozzo, Dario Fiore 0001, Antonio Guimarães, Eduardo Soria-Vazquez. 643-677 [doi]