Results 1  10
of
684
Interactive proofs and the hardness of approximating cliques
 JOURNAL OF THE ACM
, 1996
"... The contribution of this paper is twofold. First, a connection is shown between approximating the size of the largest clique in a graph and multiprover interactive proofs. Second, an efficient multiprover interactive proof for NP languages is constructed, where the verifier uses very few random b ..."
Abstract

Cited by 170 (11 self)
 Add to MetaCart
The contribution of this paper is twofold. First, a connection is shown between approximating the size of the largest clique in a graph and multiprover interactive proofs. Second, an efficient multiprover interactive proof for NP languages is constructed, where the verifier uses very few random
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
for the languages of quadratic residuosity and quadratic nonresiduosity. These are the first examples of zeroknowledge proofs for languages not known to be efficiently recognizable.
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
Entitled: ZeroKnowledge MultiProver Interactive Proofs
, 2013
"... This is to certify that the thesis prepared ..."
Quantum multiprover interactive proof systems with limited prior entanglement
 Journal of Computer and System Sciences
"... This paper gives the first formal treatment of a quantum analogue of multiprover interactive proof systems. In quantum multiprover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among prov ..."
Abstract

Cited by 46 (5 self)
 Add to MetaCart
This paper gives the first formal treatment of a quantum analogue of multiprover interactive proof systems. In quantum multiprover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among
Proofs that Yield Nothing but Their Validity or All Languages in NP Have ZeroKnowledge Proof Systems
 JOURNAL OF THE ACM
, 1991
"... In this paper the generality and wide applicability of Zeroknowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without convey ..."
Abstract

Cited by 427 (43 self)
 Add to MetaCart
In this paper the generality and wide applicability of Zeroknowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs that, for the members of a language, efficiently demonstrate membership in the language without
Quantum Multi Prover Interactive Proofs with Communicating Provers ∗
"... We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are unlimited in the classical communication between them. At first, this model may seem very weak, as provers who exchange inf ..."
Abstract
 Add to MetaCart
information seem to be equivalent in power to a simple prover. This in fact is not the case—we show that any language in NEXP can be recognized in this model efficiently, with just two provers and two rounds of communication, with a constant completenesssoundness gap. Similar ideas and techniques may help
MultiProver Verification of FloatingPoint Programs ⋆
"... Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral properties of such programs. We give a firstorder axiomatization of floatingpoint operations which allows to reduce verifica ..."
Abstract

Cited by 28 (5 self)
 Add to MetaCart
verification to checking the validity of logic formulas, in a suitable form for a large class of provers including SMT solvers and interactive proof assistants. Experiments using the FramaC platform for static analysis of C code are presented. 1
Coherent state exchange in multiprover quantum interactive proof system
 Chicago Journal of Theoretical Computer Science
"... Abstract: We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multiprover quantum interactive proof systems are given. First, we prove that there exi ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract: We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multiprover quantum interactive proof systems are given. First, we prove
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
that all languages in PSPACE have single prover interactive proofs (Lund, Fortnow, Karloff, Nisan, and Shamir), this represents a further step demonstrating the unexpectedly immense power of randomization and interaction in efficient provability. Indeed, it follows that multiple provers with coins
Results 1  10
of
684