scientific article; zbMATH DE number 66620
From MaRDI portal
Publication:4011253
zbMATH Open0751.03020MaRDI QIDQ4011253FDOQ4011253
Authors: Shafi Goldwasser 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
randomnessPSPACEzero-knowledgeproververifierinteractive proof-systemcomplexity class IPinteractive proofs of membership
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (34)
- Interactive proofs and a Shamir-like result for real number computations
- On the power of multi-prover interactive protocols
- Interactive proof systems with polynomially bounded strategies
- Automata, Languages and Programming
- Interactive Coding for Interactive Proofs
- Interactive proof systems with public coin: lower space bounds and hierarchies of complexity classes
- On memoryless provers and insincere verifiers
- Title not available (Why is that?)
- Interactive PCP
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple doubly-efficient interactive proof systems for locally-characterizable sets
- Title not available (Why is that?)
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Logspace verifiers, NC, and NP
- Does co-NP have short interactive proofs ?
- A logic of interactive proofs
- On the power of interaction
- On interactive proofs with a laconic prover
- Polynomial time interactive proofs for linear algebra with exponential matrix dimensions and scalars given by polynomial time circuits
- On doubly-efficient interactive proof systems
- Input-oblivious proof systems and a uniform complexity perspective on P/poly
- Multi-prover interactive proofs: unsound foundations
- Proving properties of interactive proofs by a generalized counting technique
- Interactive Termination Proofs Using Termination Cores
- Title not available (Why is that?)
- Some results on interactive proofs for real computations
- Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms
- Real interactive proofs for VPSPACE
- Title not available (Why is that?)
- Succinct interactive oracle proofs: applications and limitations
- Interactive protocols over the reals
- Interactive distributed proofs
- Pseudo-deterministic proofs
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 Q4011253)
