Abstract is missing.
- Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way FunctionsNoga Amit, Guy N. Rothblum. 3-37 [doi]
- Adaptively Sound Zero-Knowledge SNARKs for UPSurya Mathialagan, Spencer Peters, Vinod Vaikuntanathan. 38-71 [doi]
- Adaptive Security in SNARGs via iO and Lossy FunctionsBrent Waters, Mark Zhandry. 72-104 [doi]
- Zero-Knowledge IOPs Approaching Witness LengthNoga Ron-Zewi, Mor Weiss. 105-137 [doi]
- BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable CodesHadas Zeilberger, Binyi Chen, Ben Fisch. 138-169 [doi]
- Polymath: Groth16 Is Not the LimitHelger Lipmaa. 170-206 [doi]
- Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent SetupValerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen 0001, Hoeteck Wee. 207-242 [doi]
- Greyhound: Fast Polynomial Commitments from LatticesNgoc Khanh Nguyen 0001, Gregor Seiler. 243-275 [doi]
- Field-Agnostic SNARKs from Expand-Accumulate CodesAlexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang 0001. 276-307 [doi]
- Mangrove: A Scalable Framework for Folding-Based SNARKsWilson D. Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi, Dan Boneh. 308-344 [doi]
- HyperNova: Recursive Arguments for Customizable Constraint SystemsAbhiram Kothapalli, Srinath T. V. Setty. 345-379 [doi]
- STIR: Reed-Solomon Proximity Testing with Fewer QueriesGal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev. 380-413 [doi]
- Concretely Efficient Lattice-Based Polynomial Commitment from Standard AssumptionsIntak Hwang, Jinyeong Seo, Yongsoo Song. 414-448 [doi]
- How to Prove Statements Obliviously?Sanjam Garg, Aarushi Goel, Mingyuan Wang 0001. 449-487 [doi]