Zero-knowledge in streaming interactive proofs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1088242 (Why is no real title available?)
- scientific article; zbMATH DE number 6829278 (Why is no real title available?)
- scientific article; zbMATH DE number 1842490 (Why is no real title available?)
- scientific article; zbMATH DE number 7758324 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - EUROCRYPT 2004
- Arthur-Merlin streaming complexity
- Computational Complexity
- Delegating computation: interactive proofs for muggles
- Efficient Oblivious Transfer in the Bounded-Storage Model
- Fast learning requires good memory: a time-space lower bound for parity learning
- How to construct constant-round zero-knowledge proof systems for NP
- Interactive PCP
- Oblivious transfer with a memory-bounded receiver
- On doubly-efficient interactive proof systems
- Practical verified computation with streaming interactive proofs
- Simple schemes in the bounded storage model
- Streaming zero-knowledge proofs
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
- Verifiable stream computation and Arthur-Merlin communication
- Zero knowledge protocols from succinct constraint detection
This page was built for publication: Zero-knowledge in streaming interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862523)
