CRYPTO (10)

Publications

2024

Helger Lipmaa
Polymath: Groth16 Is Not the Limit. CRYPTO (10) (2024)
Sanjam Garg, Aarushi Goel, Mingyuan Wang
How to Prove Statements Obliviously? CRYPTO (10) (2024)
Abhiram Kothapalli, Srinath T. V. Setty
HyperNova: Recursive Arguments for Customizable Constraint Systems. CRYPTO (10) (2024)
Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang
Field-Agnostic SNARKs from Expand-Accumulate Codes. CRYPTO (10) (2024)
Brent Waters, Mark Zhandry
Adaptive Security in SNARGs via iO and Lossy Functions. CRYPTO (10) (2024)
Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup. CRYPTO (10) (2024)
Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan
Adaptively Sound Zero-Knowledge SNARKs for UP. CRYPTO (10) (2024)
Intak Hwang, Jinyeong Seo, Yongsoo Song
Concretely Efficient Lattice-Based Polynomial Commitment from Standard Assumptions. CRYPTO (10) (2024)
Noga Ron-Zewi, Mor Weiss
Zero-Knowledge IOPs Approaching Witness Length. CRYPTO (10) (2024)
Ngoc Khanh Nguyen, Gregor Seiler
Greyhound: Fast Polynomial Commitments from Lattices. CRYPTO (10) (2024)
Noga Amit, Guy N. Rothblum
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. CRYPTO (10) (2024)
Wilson D. Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi, Dan Boneh
Mangrove: A Scalable Framework for Folding-Based SNARKs. CRYPTO (10) (2024)
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
STIR: Reed-Solomon Proximity Testing with Fewer Queries. CRYPTO (10) (2024)
Hadas Zeilberger, Binyi Chen, Ben Fisch
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes. CRYPTO (10) (2024)

volume 14929, 2024

Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part X CRYPTO (10) 14929 (2024)