Batch Proofs are Statistically Hiding
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.
Abstract 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. In the case of computational soundness (aka arguments, where both honest and dishonest provers are efficient), non-interactive solutions are now known for…
related reading
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- A shallow dive into formal verificationvitalik.eth.limo
- Collaborative zkSNARKseprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Survey-SNARKs.pdfdi.ens.fr
- Doubly-efficient zkSNARKs without trusted setupeprint.iacr.org
- Reasons to believescottaaronson.blog
- dec9.pdfpeople.seas.harvard.edu
- Interactive proof system - Wikipediaen.wikipedia.org
- Zero-Knowledge Proofs | MIT CSAIL Theory of Computationtoc.csail.mit.edu
- Zero-knowledge proof - Wikipediaen.wikipedia.org