scientific article; zbMATH DE number 66620

MaRDI QIDQ4011253zbMATH OpenFDO

Authors Shafi Goldwasser

Publication date 27 September 1992

zbMATH Keywords

complexity class IPinteractive proof-systeminteractive proofs of membershipproverPSPACErandomnessverifierzero-knowledge

Mathematics Subject Classification ID

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

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

(44)

• Does co-NP have short interactive proofs ?
• Randomness in interactive proofs
• On the power of multi-prover interactive protocols
• On interactive proofs with a laconic prover
• Interactive and probabilistic proof-checking
• Interactive protocols over the reals
• Proving properties of interactive proofs by a generalized counting technique
• Interactive proof systems with polynomially bounded strategies
• A logic of interactive proofs
• Interactive proofs and a Shamir-like result for real number computations
• Multi-prover interactive proofs: unsound foundations
• Interactive Coding for Interactive Proofs
• Input-oblivious proof systems and a uniform complexity perspective on P/poly
• scientific article; zbMATH DE number 994841 (Why is no real title available?)
• scientific article; zbMATH DE number 998060 (Why is no real title available?)
• scientific article; zbMATH DE number 412256 (Why is no real title available?)
• Some results on interactive proofs for real computations
• Interactive PCP
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• On memoryless provers and insincere verifiers
• scientific article; zbMATH DE number 4080913 (Why is no real title available?)
• scientific article; zbMATH DE number 4106274 (Why is no real title available?)
• scientific article; zbMATH DE number 176552 (Why is no real title available?)
• scientific article; zbMATH DE number 512803 (Why is no real title available?)
• Finite state verifiers I
• Algebraic methods for interactive proof systems
• IP = PSPACE
• scientific article; zbMATH DE number 1072531 (Why is no real title available?)
• scientific article; zbMATH DE number 2077106 (Why is no real title available?)
• On doubly-efficient interactive proof systems
• Real interactive proofs for VPSPACE
• scientific article; zbMATH DE number 4768 (Why is no real title available?)
• Pseudo-deterministic proofs
• Simple doubly-efficient interactive proof systems for locally-characterizable sets
• Interactive proof systems with public coin: lower space bounds and hierarchies of complexity classes
• Polynomial time interactive proofs for linear algebra with exponential matrix dimensions and scalars given by polynomial time circuits
• Interactive distributed proofs
• Automata, Languages and Programming
• Interactive Termination Proofs Using Termination Cores
• Succinct interactive oracle proofs: applications and limitations
• Doubly efficient interactive proofs over infinite and non-commutative rings
• Logspace verifiers, NC, and NP
• Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms
• On the power of interaction

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)