scientific article; zbMATH DE number 66620

MaRDI QIDQ4011253zbMATH OpenFDO

Authors Shafi Goldwasser

Publication date 27 September 1992

zbMATH Keywords

randomnessPSPACEzero-knowledgeproververifierinteractive proof-systemcomplexity class IPinteractive proofs of membership

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 4106274
• IP = PSPACE
• On the power of interaction
• Finite state verifiers I
• Interactive proof systems with polynomially bounded strategies

Cited in

(34)

• Interactive proofs and a Shamir-like result for real number computations
• Interactive distributed proofs
• Pseudo-deterministic proofs
• 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
• scientific article; zbMATH DE number 2077106 (Why is no real title available?)
• Interactive PCP
• scientific article; zbMATH DE number 4080913 (Why is no real title available?)
• scientific article; zbMATH DE number 176552 (Why is no real title available?)
• Simple doubly-efficient interactive proof systems for locally-characterizable sets
• scientific article; zbMATH DE number 4106274 (Why is no real title available?)
• Doubly efficient interactive proofs over infinite and non-commutative rings
• Does co-NP have short interactive proofs ?
• Logspace verifiers, NC, and NP
• 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
• Input-oblivious proof systems and a uniform complexity perspective on P/poly
• On doubly-efficient interactive proof systems
• Multi-prover interactive proofs: unsound foundations
• Proving properties of interactive proofs by a generalized counting technique
• Interactive Termination Proofs Using Termination Cores
• scientific article; zbMATH DE number 412256 (Why is no real title available?)
• Some results on interactive proofs for real computations
• Real interactive proofs for VPSPACE
• Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• Succinct interactive oracle proofs: applications and limitations
• Interactive protocols over the reals

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)