306.pdf
eprint.iacr.org · 8,266 words · saved by 1 readers
N/A
Concretely Efficient Lattice-based Polynomial Commitment from Standard Assumptions Intak Hwang , Jinyeong Seo , and Yongsoo Song Seoul National University {intak.hwang, jinyeong.seo, y.song}@snu.ac.kr Abstract. Polynomial commitment is a crucial cryptographic primi- tive in constructing zkSNARKs. Most practical constructions to date are either vulnerable against quantum adversaries or lack homomorphic properties, which are essential for recursive proof composition and proof batching.…
related reading
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Applied Crypto #2: Polynomial Commitments | ZK Learning Resourceslearn.0xparc.org
- The Polynomial Commitment - notes.0xparc.orgnotes.0xparc.org
- 1043.pdfeprint.iacr.org
- KZG polynomial commitments · Dankrad Feistdankradfeist.de
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- 370.pdfeprint.iacr.org
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Variants of KZG: Part III, Multilinear Commitments with Zeromorphblog.zksecurity.xyz
- Commitment scheme - Wikipediaen.wikipedia.org