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
- 370.pdfeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Collaborative zkSNARKseprint.iacr.org
- thesis.pdfaayushg.com
- 1043.pdfeprint.iacr.org
- 1482.pdfeprint.iacr.org
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- 1022.pdfeprint.iacr.org
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRSeprint.iacr.org
- [2606.05433] Zero knowledge verification for frontier AI training is possiblearxiv.org
- P lonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge[0.72cm]eprint.iacr.org
- Zinc+: SNARKs for Polynomial Ringseprint.iacr.org