Results 1 
6 of
6
Unconditional security from noisy quantum storage
, 2009
"... We consider the implementation of twoparty cryptographic primitives based on the sole assumption that no largescale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide sec ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
(Show Context)
We consider the implementation of twoparty cryptographic primitives based on the sole assumption that no largescale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide security even against the most general attack. Such unconditional results were previously only known in the socalled boundedstorage model which is a special case of our setting. Our protocols can be implemented with presentday hardware used for quantum key distribution. In particular, no quantum storage is required for the honest parties.
Secure bit commitment from relativistic constraints
 IEEE Trans. Inf. Theo
, 2013
"... ar ..."
(Show Context)
Oblivious transfer, the CHSH game, and quantum encodings. arXiv:1304.0983 [quantph
, 2013
"... iv ..."
(Show Context)
Optimal bounds for quantum weak oblivious transfer
, 2013
"... Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum oblivious transfer protocols under a natural and demanding definiti ..."
Abstract
 Add to MetaCart
Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum oblivious transfer protocols under a natural and demanding definition of what it means for Alice to cheat. Our lower bound is a smooth tradeoff between the probability P?Bob with which Bob can guess Alice’s bit choice and the probability P?Alice with which Alice can guess both of Bob’s bits given that she learns one of the bits with certainty. We prove that 2P?Bob + P Alice ≥ 2 in any quantum protocol for oblivious transfer, from which it follows that one of the two parties must be able to cheat with probability at least 2/3. We prove that this bound is optimal by exhibiting a family of protocols whose cheating probabilities can be made arbitrarily close to any point on the tradeoff curve. 1
Unclonable encryption revisited (4 × 2 = 8)
"... Unclonable Encryption is a technique similar to Quantum Key Distribution and authentication of quantum states; it quantumprotects classical ciphertext so that it cannot be copied by eavesdroppers. We propose an improved variant which has higher efficiency and better error tolerance. Our variant us ..."
Abstract
 Add to MetaCart
(Show Context)
Unclonable Encryption is a technique similar to Quantum Key Distribution and authentication of quantum states; it quantumprotects classical ciphertext so that it cannot be copied by eavesdroppers. We propose an improved variant which has higher efficiency and better error tolerance. Our variant uses four cipherstate bases that are equally spaced on the Bloch sphere, instead of the usual + and × basis. 1