Streaming zero-knowledge proofs
From MaRDI portal
Cites work
- A hierarchy theorem for interactive proofs of proximity
- A Pseudorandom Generator from any One-way Function
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
- Annotations for Sparse Data Streams
- Annotations in Data Streams
- Annotations in data streams
- Arthur-Merlin streaming complexity
- Aurora: transparent succinct arguments for R1CS
- Authentication in the bounded storage model
- Batch verification and proofs of proximity with polylog overhead
- Bit commitment using pseudorandomness
- Coin flipping by telephone a protocol for solving impossible problems
- Communication Complexity
- Computational Complexity
- Computational Complexity
- Concentration inequalities. A nonasymptotic theory of independence
- Constant-round interactive proofs for delegating computation
- Data streams: algorithms and applications.
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 6829278 (Why is no real title available?)
- scientific article; zbMATH DE number 7650137 (Why is no real title available?)
- scientific article; zbMATH DE number 7758324 (Why is no real title available?)
- Interactive proofs of proximity: delegating computation in sublinear time
- Non-interactive proofs of proximity
- Practical verified computation with streaming interactive proofs
- Probabilistically checkable proofs of proximity with zero-knowledge
- Proofs of proximity for context-free languages and read-once branching programs
- Proofs of proximity for distribution testing
- Simple schemes in the bounded storage model
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Speak much, remember little: cryptography in the bounded storage model, revisited
- Streaming graph computations with a helpful advisor
- Streaming Verification in Data Analysis
- Streaming verification of graph properties
- The Complexity of Zero Knowledge
- The space complexity of approximating the frequency moments
- Time-optimal interactive proofs for circuit evaluation
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
- Verifiable stream computation and Arthur-Merlin communication
- Zero knowledge protocols from succinct constraint detection
- Zero-knowledge proofs of proximity
Cited in
(2)
This page was built for publication: Streaming zero-knowledge proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866495)
