Shared versus private randomness in distributed interactive proofs
From MaRDI portal
Cites work
- Algebraic methods for interactive proof systems
- Approximate proof-labeling schemes
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Communication Complexity
- Cycles of even length in graphs
- Distributed Computing: A Locality-Sensitive Approach
- Distributed verification of minimum spanning trees
- scientific article; zbMATH DE number 1256775 (Why is no real title available?)
- scientific article; zbMATH DE number 1769898 (Why is no real title available?)
- Interactive distributed proofs
- IP = PSPACE
- Locally checkable proofs in distributed computing
- On distributed Merlin-Arthur decision protocols
- On randomized one-round communication complexity
- Proof labeling schemes
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public vs. private randomness in simultaneous multi-party communication complexity
- Randomized proof-labeling schemes
- Randomized proof-labeling schemes
- The Knowledge Complexity of Interactive Proof Systems
- The power of distributed verifiers in interactive proofs
- The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
- Towards a complexity theory for local distributed computing
- Trade-offs in distributed interactive proofs
- Transaction protection by beacons
- What Can be Computed Locally?
This page was built for publication: Shared versus private randomness in distributed interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022271)
