Results 1  10
of
30
Secure multiparty quantum computation with (only) a strict honest majority.
 In FOCS,
, 2006
"... ..."
(Show Context)
Quantum weak coin flipping with arbitrarily small bias
 WCF, 2007. quantph:0711.4114. 11 [SR01] [SR02] Ashwin Nayak and
"... “God does not play dice. He flips coins instead. ” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructio ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
“God does not play dice. He flips coins instead. ” And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum weak coin flipping so that we too may flip coins. Instructions for the flipping of coins are contained herein. But be warned! Only those who have mastered Kitaev’s formalism relating coin flipping and operator monotone functions may succeed. For those foolhardy enough to even try, a complete tutorial is included. Contents 1
Level reduction and the quantum threshold theorem
 PH.D. THESIS, CALTECH, 2007, EPRINT ARXIV:QUANTPH/0703230
, 2007
"... ..."
(Show Context)
Exact quantum algorithms for the leader election problem
 In Proceedings of the TwentySecond Symposium on Theoretical Aspects of Computer Science (STACS 2005), volume 3404 of Lecture Notes in Computer Science
, 2005
"... ar ..."
(Show Context)
Approximate Quantum ErrorCorrecting Codes and Secret Sharing Schemes
 In Advances in Cryptology: Proceedings of EUROCRYPT 2005, SpringerVerlag’s Lecture Notes in Computer Science, Volume 3494
, 2005
"... It is a standard result in the theory of quantum errorcorrecting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies to codes which recover the message exactly. Naively, one mig ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
(Show Context)
It is a standard result in the theory of quantum errorcorrecting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies to codes which recover the message exactly. Naively, one might expect that correcting errors to very high fidelity would only allow small violations of this bound. This intuition is incorrect: in this paper we describe quantum errorcorrecting codes capable of correcting up to ⌊(n − 1)/2⌋ arbitrary errors with fidelity exponentially close to 1, at the price of increasing the size of the registers (i.e., the coding alphabet). This demonstrates a sharp distinction between exact and approximate quantum error correction. The codes have the property that any t components reveal no information about the message, and so they can also be viewed as errortolerant secret sharing schemes. The construction has several interesting implications for cryptography and quantum information theory. First, it suggests that secret sharing is a better classical analogue to quantum error correction than is classical error correction. Second, it highlights an error in a purported proof that verifiable quantum secret sharing (VQSS) is impossible when the number of cheaters t is n/4. In particular, the construction directly yields an honestdealer VQSS scheme for t = ⌊(n − 1)/2⌋. We believe the codes could also potentially lead to improved protocols for dishonestdealer VQSS and secure multiparty quantum computation. More generally, the construction illustrates a difference between exact and approximate requirements in quantum cryptography and (yet again) the delicacy of security proofs and impossibility results in the quantum model. 1
L.: Secure twoparty quantum evaluation of unitaries against specious adversaries
 Advances in Cryptology, Proceedings of Crypto 2010
, 2010
"... ar ..."
(Show Context)
Quantum anonymous transmissions
, 2005
"... We consider the problem of hiding sender and receiver of classical and quantum bits (qubits), even if all physical transmissions can be monitored. We present a quantum protocol for sending and receiving classical bits anonymously, which is completely traceless: it successfully prevents later reconst ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We consider the problem of hiding sender and receiver of classical and quantum bits (qubits), even if all physical transmissions can be monitored. We present a quantum protocol for sending and receiving classical bits anonymously, which is completely traceless: it successfully prevents later reconstruction of the sender. We show that this is not possible classically. It appears that entangled quantum states are uniquely suited for traceless anonymous transmissions. We then extend this protocol to send and receive qubits anonymously. In the process we introduce a new primitive called anonymous entanglement, which may be useful in other contexts as well.
F.: Classical cryptographic protocols in a quantum world
 In: CRYPTO. LNCS
, 2011
"... Abstract. Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If we accept that quantum information ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If we accept that quantum information processing is the most realistic model of physically feasible computation, then we must ask: what classical protocols remain secure against quantum attackers? Our main contribution is showing the existence of classical twoparty protocols for the secure evaluation of any polynomialtime function under reasonable computational assumptions (for example, it suffices that the learning with errors problem be hard for quantum polynomial time). Our result shows that the basic twoparty feasibility picture from classical cryptography remains unchanged in a quantum world.
Secure Multiparty Computation for selecting a solution according to a uniform distribution over all solutions of a general combinatorial problem
, 2004
"... Secure simulations of arithmetic circuit and boolean circuit evaluations are known to save privacy while providing solutions to any probabilistic function over a field. The problem we want to solve is to select a random solution of a general combinatorial problem. Here we discuss how to specify the ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Secure simulations of arithmetic circuit and boolean circuit evaluations are known to save privacy while providing solutions to any probabilistic function over a field. The problem we want to solve is to select a random solution of a general combinatorial problem. Here we discuss how to specify the need of selecting a random solution of a general combinatorial problem, as a probabilistic function. Arithmetic circuits for finding the set of all solutions are simple to design [24].