scientific article; zbMATH DE number 6829278
From MaRDI portal
Publication:4601830
Recommendations
- Verifiable stream computation and Arthur-Merlin communication
- Practical verified computation with streaming interactive proofs
- Verifiable computation in multiparty protocols with honest majority
- Verifiable computation with reduced informational costs and computational costs
- Robust lower bounds for communication and stream computation
- On communication protocols that compute almost privately
- On communication protocols that compute almost privately
- scientific article; zbMATH DE number 1676641
- Verifiable multi-party computation with perfectly private audit trail
- Communication and Randomness Lower Bounds for Secure Computation
Cited in
(20)- The landscape of communication complexity classes
- Non-interactive proofs of proximity
- An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
- Arthur-Merlin streaming complexity
- Streaming computations with a loquacious prover
- Zero-information protocols and unambiguity in Arthur-Merlin communication
- Streaming verification of graph properties
- A hierarchy theorem for interactive proofs of proximity
- Proofs of proximity for distribution testing
- An exponential separation between MA and AM proofs of proximity
- The complexity of quantum disjointness
- On the power of statistical zero knowledge
- Verifiable stream computation and Arthur-Merlin communication
- Arthur-Merlin streaming complexity
- scientific article; zbMATH DE number 7650137 (Why is no real title available?)
- scientific article; zbMATH DE number 7758324 (Why is no real title available?)
- A hierarchy of constant communication complexity
- Zero-knowledge in streaming interactive proofs
- Streaming zero-knowledge proofs
- New lower bounds in Merlin-Arthur communication and graph streaming verification
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601830)
