Streaming Zero-Knowledge Proofs
Graham Cormode, Marcel Dall'Agnol, Tom Gur, Chris Hickey

TL;DR
This paper introduces zero-knowledge proofs for streaming algorithms, enabling verification of large data computations with minimal space and communication, using novel protocols based on sumcheck and polynomial evaluation.
Contribution
It defines zero-knowledge in streaming settings and constructs efficient protocols for key streaming problems, expanding the scope of streaming interactive proofs.
Findings
Zero-knowledge SIPs for index, point, and range queries.
Protocols have polylogarithmic verifier space complexity.
Efficient non-interactive setup with near-linear randomness.
Abstract
Streaming interactive proofs (SIPs) enable a space-bounded algorithm with one-pass access to a massive stream of data to verify a computation that requires large space, by communicating with a powerful but untrusted prover. This work initiates the study of zero-knowledge proofs for data streams. We define the notion of zero-knowledge in the streaming setting and construct zero-knowledge SIPs for the two main algorithmic building blocks in the streaming interactive proofs literature: the sumcheck and polynomial evaluation protocols. To the best of our knowledge all known streaming interactive proofs are based on either of these tools, and indeed, this allows us to obtain zero-knowledge SIPs for central streaming problems such as index, point and range queries, median, frequency moments, and inner product. Our protocols are efficient in terms of time and space, as well as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
