arXiv:quant-ph/0512231

Proof of Security of a High-Capacity Quantum Key Distribution Protocol

Xiaowei Zhang, Kai Wen, Long, Gui Lu

Published Dec 25, 2005• 0 citations

Abstract

We prove the security of a high-capacity quantum key distribution protocol over noisy channels. By using entanglement purification protocol, we construct a modified version of the protocol in which we separate it into two consecutive stages. We prove their securities respectively and hence the security of the whole protocol.

DOI: 10.48550/arxiv.quant-ph/0512231

Related papers

Private entanglement over arbitrary distances, even using noisy apparatus

Hans Aschauer, Hans J. Briegel

We give a security proof of quantum cryptography based entirely on entanglement purification. Our proof applies to all possible attacks (individual and coherent). It implies the security of cryptographic keys distributed with the help of entanglement-based quantum repeaters. We prove the security of the obtained quantum channel which may not only be used for quantum key distribution, but also for secure, albeit noisy, transmission of quantum information.

arXiv:quant-ph/0008051Aug 10, 20001 citation

Private Entanglement over Arbitrary Distances, Even Using Noisy Apparatus

Hans Aschauer, Hans J. Briegel

We give a security proof of quantum cryptography based entirely on entanglement purification. Our proof applies to all possible attacks (individual and coherent). It implies the security of cryptographic keys distributed with the help of entanglement-based quantum repeaters. We prove the security of the obtained quantum channel which may not be used only for quantum key distribution, but also for secure, albeit noisy, transmission of quantum information.

Physical Review LettersJan 9, 200235 citations

Secure quantum communication over arbitrary distances

Hans Aschauer, Hans J. Briegel

We give a security proof of quantum cryptography based entirely on entanglement purification. Our proof applies to all possible attacks (individual and coherent) and to arbitrary distances. We prove the security of the obtained quantum channel which may not only be used for quantum key distribution, but also for secure transmission of quantum information.

Aug 10, 20001 citation

Security Proof of a Semi-Quantum Key Distribution Protocol: Extended Version

Walter O. Krawec

Semi-quantum key distribution protocols are designed to allow two users to establish a secure secret key when one of the two users is limited to performing certain "classical" operations. There have been several such protocols developed recently, however, due to their reliance on a two-way quantum communication channel (and thus, the attacker's opportunity to interact with the qubit twice), their security analysis is difficult and little is known concerning how secure they are compared to their fully quantum counterparts. In this paper we prove the unconditional security of a particular semi-quantum protocol. We derive an expression for the key rate of this protocol, in the asymptotic scenario, as a function of the quantum channel's noise. Finally, we will show that this semi-quantum protocol can tolerate a maximal noise level comparable to certain fully quantum protocols.

arXiv:1412.0282Nov 30, 20142 citations

Information-theoretic security proof for quantum-key-distribution protocols

Renato Renner, Nicolas Gisin, Barbara Kraus

We present a technique for proving the security of quantum-key-distribution (QKD) protocols. It is based on direct information-theoretic arguments and thus also applies if no equivalent entanglement purification scheme can be found. Using this technique, we investigate a general class of QKD protocols with one-way classical post-processing. We show that, in order to analyze the full security of these protocols, it suffices to consider collective attacks. Indeed, we give new lower and upper bounds on the secret-key rate which only involve entropies of two-qubit density operators and which are thus easy to compute. As an illustration of our results, we analyze the Bennett-Brassard 1984, the six-state, and the Bennett 1992 protocols with one-way error correction and privacy amplification. Surprisingly, the performance of these protocols is increased if one of the parties adds noise to the measurement data before the error correction. In particular, this additional noise makes the protocols more robust against noise in the quantum channel.

arXiv:quant-ph/0502064Physical Review AJul 25, 2005521 citations

Security proof of a semi-quantum key distribution protocol

Walter O. Krawec

Semi-quantum key distribution protocols are designed to allow two users to establish a secure secret key when one of the two users is limited to performing certain “classical” operations. There have been several such protocols developed recently, however, due to their reliance on a two-way quantum communication channel (and thus, the attacker's opportunity to interact with the qubit twice), their security analysis is difficult and little is known concerning how secure they are compared to their fully quantum counterparts. In this paper we prove the unconditional security of a particular semi-quantum protocol and derive an expression for its key rate, in the asymptotic scenario.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 201580 citations