


default search action
44th CRYPTO 2024, Santa Barbara, CA, USA - Part X
- Leonid Reyzin, Douglas Stebila
:
Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part X. Lecture Notes in Computer Science 14929, Springer 2024, ISBN 978-3-031-68402-9
Succinct Arguments
- Noga Amit
, Guy N. Rothblum
:
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. 3-37 - Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan:
Adaptively Sound Zero-Knowledge SNARKs for UP. 38-71 - Brent Waters, Mark Zhandry:
Adaptive Security in SNARGs via iO and Lossy Functions. 72-104 - Noga Ron-Zewi
, Mor Weiss
:
Zero-Knowledge IOPs Approaching Witness Length. 105-137 - Hadas Zeilberger, Binyi Chen, Ben Fisch:
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes. 138-169 - Helger Lipmaa
:
Polymath: Groth16 Is Not the Limit. 170-206 - Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee:
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup. 207-242 - Ngoc Khanh Nguyen, Gregor Seiler:
Greyhound: Fast Polynomial Commitments from Lattices. 243-275 - Alexander R. Block
, Zhiyong Fang, Jonathan Katz
, Justin Thaler, Hendrik Waldner
, Yupeng Zhang:
Field-Agnostic SNARKs from Expand-Accumulate Codes. 276-307 - Wilson D. Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi
, Dan Boneh:
Mangrove: A Scalable Framework for Folding-Based SNARKs. 308-344 - Abhiram Kothapalli, Srinath T. V. Setty:
HyperNova: Recursive Arguments for Customizable Constraint Systems. 345-379 - Gal Arnon
, Alessandro Chiesa, Giacomo Fenzi
, Eylon Yogev
:
STIR: Reed-Solomon Proximity Testing with Fewer Queries. 380-413 - Intak Hwang
, Jinyeong Seo
, Yongsoo Song
:
Concretely Efficient Lattice-Based Polynomial Commitment from Standard Assumptions. 414-448 - Sanjam Garg, Aarushi Goel, Mingyuan Wang:
How to Prove Statements Obliviously? 449-487

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.