Results 11  20
of
4,773
Abstract
, 2007
"... The central question in quantum multiprover interactive proof systems is whether or not entanglement shared between provers affects the verification power of the proof system. We study for the first time positive aspects of prior entanglement and show that entanglement is useful even for honest pro ..."
Abstract
 Add to MetaCart
The central question in quantum multiprover interactive proof systems is whether or not entanglement shared between provers affects the verification power of the proof system. We study for the first time positive aspects of prior entanglement and show that entanglement is useful even for honest
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
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
Delegation for Bounded Space [Extended Abstract]
"... We construct a 1round delegation scheme for every language computable in time t = t(n) and space s = s(n), where the running time of the prover is poly(t) and the running time of the verifier is Õ(n + poly(s)) (where Õ hides polylog(t) factors). The proof exploits a curious connection between the p ..."
Abstract
 Add to MetaCart
the problem of computation delegation and the model of multiprover interactive proofs that are sound against nosignaling (cheating) strategies, a model that was studied in the context of multiprover interactive proofs with provers that share quantum entanglement, and is motivated by the physical principle
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
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
Witness Signatures and NonMalleable MultiProver ZeroKnowledge Proofs
"... Motivated by the goal of removing trusted setup assumptions from cryptography, we introduce the notion of witness signatures. This primitive allows any party with a valid witness to an NP statement to sign a message on behalf of that statement. We also require these signatures to be unforgeable: tha ..."
Abstract
 Add to MetaCart
). Interestingly, we show witness signatures in the hardware token model are closely related to what we call nonmalleable multiprover zeroknowledge proofs in the plain model (i.e. without hardware tokens). We initiate the study of nonmalleable multiprover zeroknowledge proofs, and, provide an unconditional
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
Oracularization and TwoProver OneRound Interactive Proofs against Nonlocal Strategies
, 2008
"... A central problem in quantum computational complexity is how to prevent entanglementassisted cheating in multiprover interactive proof systems. It is wellknown that the standard oracularization technique completely fails in some proof systems under the existence of prior entanglement. This paper ..."
Abstract
 Add to MetaCart
A central problem in quantum computational complexity is how to prevent entanglementassisted cheating in multiprover interactive proof systems. It is wellknown that the standard oracularization technique completely fails in some proof systems under the existence of prior entanglement. This paper
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (48 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Results 11  20
of
4,773