Results 1  10
of
146,785
The knowledge complexity of interactive proof systems

, 1989
"... Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltonian. In th ..."
Abstract

Cited by 1246 (39 self)
 Add to MetaCart
/nonHamiltonian. In this paper a computational complexity theory of the "knowledge " contained in a proof is developed. Zeroknowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zeroknowledge proof systems are given
Algebraic Methods for Interactive Proof Systems
, 1990
"... We present a new algebraic technique for the construction of interactive proof systems. We use our technique to prove that every language in the polynomialtime hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP=PSPACE (Shamir) and that MIP ..."
Abstract

Cited by 338 (28 self)
 Add to MetaCart
We present a new algebraic technique for the construction of interactive proof systems. We use our technique to prove that every language in the polynomialtime hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP=PSPACE (Shamir
On helping and interactive proof systems
 International Journal of Foundations of Computer Science
, 1995
"... We investigate the complexity of honest provers in interactive proof systems. This corresponds precisely to the complexity of oracles helping the computation of robust probabilistic oracle machines. We obtain upper bounds for languages in FewEXP and for sparse sets in NP. Further, interactive protoc ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We investigate the complexity of honest provers in interactive proof systems. This corresponds precisely to the complexity of oracles helping the computation of robust probabilistic oracle machines. We obtain upper bounds for languages in FewEXP and for sparse sets in NP. Further, interactive
Quantum Complexities and Interactive Proof Systems
, 2006
"... In complexity studies, Interactive Proof Systems are a very helpful means to establish relationships between major complexity classes. The rise of new complexity classes, which follow the properties of quantum computation, suggests a new set of variants of these systems. This paper focuses on the cu ..."
Abstract
 Add to MetaCart
In complexity studies, Interactive Proof Systems are a very helpful means to establish relationships between major complexity classes. The rise of new complexity classes, which follow the properties of quantum computation, suggests a new set of variants of these systems. This paper focuses
On Completeness and Soundness in Interactive Proof Systems
, 1989
"... An interactive proof system with Perfect Completeness (resp. Perfect Soundness) for a language L is an interactive proof (for L) in which for every x 2 L (resp. x 62 L) the verifier always accepts (resp. always rejects). We show that any language having an interactive proof system has one (of the A ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
An interactive proof system with Perfect Completeness (resp. Perfect Soundness) for a language L is an interactive proof (for L) in which for every x 2 L (resp. x 62 L) the verifier always accepts (resp. always rejects). We show that any language having an interactive proof system has one (of
ComplexityTheoretic Aspects of Interactive Proof Systems
, 1989
"... In 1985, Goldwasser, Micali and Rackoff formulated interactive proof systems as a tool for developing cryptographic protocols. Indeed, many exciting cryptographic results followed from studying interactive proof systems and the related concept of zeroknowledge. Interactive proof systems also have a ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
In 1985, Goldwasser, Micali and Rackoff formulated interactive proof systems as a tool for developing cryptographic protocols. Indeed, many exciting cryptographic results followed from studying interactive proof systems and the related concept of zeroknowledge. Interactive proof systems also have
On the Power of Quantum MultiProver Interactive Proof Systems
, 2001
"... In this paper we introduce a quantum analogue of multiprover interactive proof systems by naturally extending the model of singleprover quantum interactive proof systems defined by Watrous. It is proved that the class of languages having quantum multiprover interactive proof systems is equal to N ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we introduce a quantum analogue of multiprover interactive proof systems by naturally extending the model of singleprover quantum interactive proof systems defined by Watrous. It is proved that the class of languages having quantum multiprover interactive proof systems is equal
An application of quantum finite automata to interactive proof systems
 in Proc. 9th International Conference on Implementation and Application of Automata, LNCS, Vol.3317
, 2004
"... Abstract: Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finitedimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover commun ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract: Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finitedimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover
Results 1  10
of
146,785