Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
نویسنده
چکیده
We prove the unconditional security of a quantum key distribution (QKD) protocol on a noisy channel against the most general attack allowed by quantum physics. We use the fact that in a previous paper we have reduced the proof of the unconditionally security of this QKD protocol to a proof that a corresponding Quantum String Oblivious Transfer (String-QOT) protocol would be unconditionally secure against Bob if implemented on top of an unconditionally secure bit commitment scheme. We prove a lemma that extends a security proof given by Yao for a (one bit) QOT protocol to this String-QOT protocol. This result and the reduction mentioned above implies the unconditional security of our QKD protocol despite our previous proof that unconditionally secure bit commitment schemes are impossible.
منابع مشابه
Robust cryptography in the noisy-quantum-storage model
It was shown in [42] that cryptographic primitives can be implemented based on the assumption that quantum storage of qubits is noisy. In this work we analyze a protocol for the universal task of oblivious transfer that can be implemented using quantumkey-distribution (QKD) hardware in the practical setting where honest participants are unable to perform noise-free operations. We derive trade-o...
متن کاملOn the Oblivious Transfer Capacity of Generalized Erasure Channels against Malicious Adversaries
Noisy channels are a powerful resource for cryptography as they can be used to obtain information-theoretically secure key agreement, commitment and oblivious transfer protocols, among others. Oblivious transfer (OT) is a fundamental primitive since it is complete for secure multiparty computation, and the OT capacity characterizes how efficiently a channel can be used for obtaining string obli...
متن کاملOblivious transfer based on single-qubit rotations
We present a bit-string quantum oblivious transfer protocol based on single-qubit rotations. The proposed protocol does not violate the Lo’s nogo theorem that prevents the unconditional security of 1-out-of-2 oblivious transfer. Our protocol is based on a previously proposed quantum public key protocol and its security relies on the laws of Quantum Mechanics. We also present a single-bit oblivi...
متن کاملEfficient Oblivious Transfer Protocols Achieving a Non-zero Rate from Any Non-trivial Noisy Correlation
Oblivious transfer (OT) is a two-party primitive which is one of the cornerstones of modern cryptography. We focus on providing information-theoretic security for both parties, hence building OT assuming noisy resources (channels or correlations) available to them. This primitive is about transmitting two strings such that the receiver can obtain one (and only one) of them, while the sender rem...
متن کاملOblivious Transfer from Weak Noisy Channels
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because in a cryptographic setting, these noisy channels must satisfy very strong security requirements. Unfair noisy channels, introduced by Damg̊ard, Kilian and Salvail [Eurocrypt ’99], reduce these limitations: They give the ...
متن کامل