1482.pdf
eprint.iacr.org · 9,951 words · saved by 1 readers
N/A
Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof∗ Jiaheng Zhang† Tiancheng Xie† Yupeng Zhang‡ Dawn Song† Abstract We present a new succinct zero knowledge argument scheme for layered arithmetic circuits without trusted setup. The prover time is O(C + n log n) and the proof size is O(D log C + log2 n) for a D-depth circuit with n inputs and C gates. The verification time is also succinct, O(D log C + log2…
related reading
- 370.pdfeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Collaborative zkSNARKseprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- thesis.pdfaayushg.com
- [2606.05433] Zero knowledge verification for frontier AI training is possiblearxiv.org
- 1022.pdfeprint.iacr.org
- STARK-paper.pdfstarkware.co
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- 1021.pdfeprint.iacr.org
- A Succinct Story of Zero Knowledgenibnalin.me