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
- Zero-Knowledge Proofs | MIT CSAIL Theory of Computationtoc.csail.mit.edu
- Lecture 14: Zero knowledge proofsboazbarak.org
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- Survey-SNARKs.pdfdi.ens.fr
- Flock: Fast Proving for Batch Boolean Computationseprint.iacr.org
- A Succinct Story of Zero Knowledgenibnalin.me
- 370.pdfeprint.iacr.org
- Bulletproofs: Short Proofs for Confidential Transactions and Moreeprint.iacr.org
- 1021.pdfeprint.iacr.org