Results 1  10
of
12
Superposition Attacks on Cryptographic Protocols
"... Abstract. Attacks on cryptographic protocols are usually modeled by allowing an adversary to ask queries to an oracle. Security is then defined by requiring that as long as the queries satisfy some constraint, there is some problem the adversary cannot solve, such as compute a certain piece of infor ..."
Abstract
 Add to MetaCart
sharing result to design zeroknowledge proofs for all of NP in the common reference string model. While our protocol is classical, it is sound against a cheating unbounded quantum prover and computational zeroknowledge even if the verifier is allowed a superposition attack. Finally, we consider multiparty
Quantum Interactive Proofs with Competing Provers
, 2004
"... Abstract This paper studies quantum refereed games, which are quantum interactive proof systemswith two competing provers: one that tries to convince the verifier to accept and the other that tries to convince the verifier to reject. We prove that every language having an ordinary quantum interacti ..."
Abstract
 Add to MetaCart
having large minimal trace distance from one another. We alsoshow how to reduce the probability of error for some classes of quantum refereed games. 1 Introduction A refereed game consists of a conversation between a computationally bounded verifier and twocomputationally unbounded provers regarding some
Upper bounds for quantum interactive proofs with competing provers
 In Proceedings of the 20th Annual IEEE Conference on Computational Complexity
, 2005
"... Refereed games are interactive proof systems with two competing provers: one that tries to convince the verier to accept and another that tries to convince the verier to reject. In quantum refereed games, the provers and verier may perform quantum computations and exchange quantum messages. One may ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
consider games with a bounded or unbounded number of rounds of messages between the verier and provers. In this paper, we prove classical upper bounds on the power of both oneround and manyround quantum refereed games. In particular, we use semidenite programming to show that manyround quantum
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
A lattice problem in quantum NP
 In Proc. 44th IEEE Symposium on Foundations of Computer Science
, 2003
"... We consider coGapSV P √ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM∩coNP but is not known to be in NP or in MA. We prove that it lies inside QMA, the quantum analogue of NP. This is the first nontrivial upper bound on the quantum complexity of a l ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
in order to cheat. The second idea involves using estimations of autocorrelation functions for verification. We make the important observation that autocorrelation functions are positive definite functions and using properties of such functions we severely restrict the prover’s possibility to cheat. We
Interactive Proofs For Quantum Computations
, 2008
"... The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems perform as they should, if we cannot efficiently compute pred ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
computation. Can the customer be convinced of correctness without the ability to compare results to predictions? To provide answers to these questions, we define Quantum Prover Interactive Proofs (QPIP). Whereas in standard Interactive Proofs [GMR85] the prover is computationally unbounded, here our prover
How to Delegate Computations: The Power of NoSignaling Proofs
"... We construct a 1round delegation scheme (i.e., argumentsystem) for every language computable in time t = t(n), where the running time of the prover is poly(t) and the running time of the verifier is n · polylog(t). In particular, for every language in P we obtain a delegation scheme with almost li ..."
Abstract
 Add to MetaCart
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 that information cannot travel faster than light. For any language computable in time t = t(n), we
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
D.: Isolated proofs of knowledge and isolated zero knowledge
 In: EUROCRYPT
, 2008
"... Abstract. We introduce a new notion called ℓisolated proofs of knowledge (ℓIPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to ℓ bits of communication with some external adversarial environment during the run of the proof. Without any additional setup assumpti ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. We introduce a new notion called ℓisolated proofs of knowledge (ℓIPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to ℓ bits of communication with some external adversarial environment during the run of the proof. Without any additional setup
On the (Im)Plausibility of ConstantRound PublicCoin StraightLineSimulatable ZeroKnowledge Proofs
"... Abstract. In 2001, a breakthrough result by Barak [FOCS 2001] showed how to achieve publiccoin zeroknowledge (ZK) arguments in constant rounds, a feature known to be impossible using blackbox simulation. In this approach, the simulator makes use of the code of the malicious verifier in computing ..."
Abstract
 Add to MetaCart
is an improved structurepreserving version of the wellknown BabaiMoran Speedup (derandomization) Theorem, which essentially says that, for a constantround publiccoin interactive proof system in which the verifier sends m messages and each of the prover messages is of length p, if the cheating probability
Results 1  10
of
12