✳flâneur — a map of the web's best reading
Batch Proofs are Statistically Hiding
simons.berkeley.edu · 1 words · saved by 1 readers
Batch proofs are (possibly interactive) proof-systems that convince a verifier that x_1,...,x_t are in L, for some NP language L, with communication that is much shorter than sending the t witnesses. Batch proofs have been studied in various settings in recent years. In the case of statistical soundness (where the cheating prover is unbounded but honest prover is efficient), interactive solutions are known for any UP language.
Image
Explore this link on the map →related reading
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Zero-Knowledge Proofs | MIT CSAIL Theory of Computationtoc.csail.mit.edu
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Lecture 14: Zero knowledge proofsboazbarak.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Interactive proof system - Wikipediaen.wikipedia.org
- Pearl Whitepaperpearlresearch.ai
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- protocol-labs-the-future-of-zk-proofs.pdfprotocol.ai
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io