Greyhound: Fast Polynomial Commitments from Lattices

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annual International Cryptology Conference (44. : 2024 : Santa Barbara, Calif.) Advances in cryptology - CRYPTO 2024 ; Part 10
1. Verfasser:	Nguyen, Ngoc Khanh (VerfasserIn)
Weitere Verfasser:	Seiler, Gregor (VerfasserIn)
Pages:	2024
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2024
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
How to Prove Statements Obliviously?	2024	Garg, Sanjam
Zero-Knowledge IOPs Approaching Witness Length	2024	Ron-Zewi, Noga
Field-Agnostic SNARKs from Expand-Accumulate Codes	2024	Block, Alexander R.
Adaptive Security in SNARGs via iO and Lossy Functions	2024	Waters, Brent
Mangrove: A Scalable Framework for Folding-Based SNARKs	2024	Nguyen, Wilson
Greyhound: Fast Polynomial Commitments from Lattices	2024	Nguyen, Ngoc Khanh
HyperNova: Recursive Arguments for Customizable Constraint Systems	2024	Kothapalli, Abhiram
Adaptively Sound Zero-Knowledge SNARKs for UP	2024	Mathialagan, Surya
Concretely Efficient Lattice-Based Polynomial Commitment from Standard Assumptions	2024	Hwang, Intak
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions	2024	Amit, Noga
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes	2024	Zeilberger, Hadas
STIR: Reed-Solomon Proximity Testing with Fewer Queries	2024	Arnon, Gal
Polymath: Groth16 Is Not the Limit	2024	Lipmaa, Helger
Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup	2024	Cini, Valerio