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
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- 370.pdfeprint.iacr.org
- Zero Knowledge Canon, part 1 & 2 - a16z cryptoa16zcrypto.com
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- STARK-paper.pdfstarkware.co
- Spartaneprint.iacr.org
- Zero-Knowledge Proofs | MIT CSAIL Theory of Computationtoc.csail.mit.edu
- A Zero Knowledge Sumcheck and its Applicationsarxiv.org
- 1021.pdfeprint.iacr.org