This paper is withdrawn. We study the quantum key distribution (QKD) protocol based on a quantum retrodiction protocol, namely the so-called mean king problem. The security is analyzed by considering the eavesdropping on both the preparation of the entangled pair and the transmission of the quantum state. This QKD protocol can generate efficiently a bit of raw key in every single run. We find that, for qubit system, it is more secure than the QKD Bennett-Brassard 1984 protocol and the six-state protocol. This QKD protocol works also for higher dimensional system.
This paper is withdrawn. We study the quantum key distribution (QKD) protocol based on a quantum retrodiction protocol, namely the so-called mean king problem. The security is analyzed by considering the eavesdropping on both the preparation of the entangled pair and the transmission of the quantum state. This QKD protocol can generate efficiently a bit of raw key in every single run. We find that, for qubit system, it is more secure than the QKD Bennett-Brassard 1984 protocol and the six-state protocol. This QKD protocol works also for higher dimensional system.
Quantum key distribution (QKD) allows two spatially separated parties to securely generate a cryptographic key. The first QKD protocol, published by C. H. Bennett and G. Brassard in 1984 (BB84), describes how this is achieved by transmitting individual qubits and exchanging classical authenticated information. Any attempt to eavesdrop on the protocol introduces errors detectable by the legitimate parties. This Licentiate Thesis studies the recently introduced EEQKD protocol which builds on BB84. In EEQKD, the qubits sent individually in BB84 are entangled and thus not directly available to an eavesdropper who is, in this protocol, provided only one-by-one access to the transmission. The maximal information an eavesdropper can gain using a straightforward intercept-resend (IR) attack, is obtained for a given error rate. The secure key generation rate of EEQKD is estimated in practical scenarios including qubit loss and quantum channel noise. In addition, an exquisite vulnerability is exposed: For a particular setting of qubit entanglement, paradoxically proving most useful in the face of an IR attack, EEQKD reduces to BB84. Part of this research has been published in O. Ahonen et al., Physical Review A 78, 032314 (2008).
Classical cryptographic systems are increasingly challenged by advances in computing power and new algorithmic techniques, particularly with the rise of quantum computing, which threatens the security of current encryption methods. This has spurred interest in quantum-resistant cryptography, aimed at creating algorithms that can withstand attacks from quantum computers. Traditionally, secure key transport over alternate channels has been a significant challenge, but quantum mechanics offers a solution. Quantum Key Distribution (QKD) is a revolutionary method for secure communication that leverages quantum principles. Unlike traditional methods, QKD provides unconditional security, with key security ensured by the laws of physics rather than computational difficulty. The BB84 protocol, introduced in 1984 by Bennett and Brassard, is a leading QKD scheme known for its simplicity and effectiveness in generating eavesdropping-resistant cryptographic keys. It facilitates secure key transport over alternate channels. This documentation aims to advance QKD security by practically implementing and analyzing the BB84 protocol. Through detailed theoretical analysis, simulation studies, and experimental validation, the practical impacts, and limitations of BB84-based QKD systems are examined. Additionally, a practical implementation of quantum key distribution using a sudoku key demonstrates the process's simplicity and effectiveness. These findings are expected to pave new paths in the field of cryptanalysis in the emerging Quantum Age.
We investigate the resilience to noise of single-qubit quantum key distribution (QKD) protocols in the scenario of security against independent eavesdropping attacks and key distillation based on one-way classical communication. To this end, we introduce a noise-based metric that quantifies the efficiency of QKD protocols. Within this framework, we analyze the maximal noise levels that allow Alice and Bob to asymptotically establish a secure secret key. Using this assumption, we compare the noise tolerance of general single-qubit QKD protocols, in particular the BB84, B92, E91, and six-state protocols. Our main result determines the noise level threshold for QKD allowing one to distill an asymptotically secure secret key. Additionally, we demonstrate that the six-state protocol achieves the greatest resistance to noise while simultaneously yielding a higher post-selection efficiency than the other analyzed single-qubit protocols, confirming its robustness within the considered security model. Finally, we perform an analysis of the proposed noise-based metric and the conventional quantum bit error rate (QBER) metric.
Shor and Preskill (see Phys. Rev. Lett., vol.85, p.441, 2000) have provided a simple proof of security of the standard quantum key distribution scheme by Bennett and Brassard (1984) by demonstrating a connection between key distribution and entanglement purification protocols (EPPs) with one-way communications. Here, we provide proofs of security of standard quantum key distribution schemes, Bennett and Brassard and the six-state scheme, against the most general attack, by using the techniques of two-way entanglement purification. We demonstrate clearly the advantage of classical post-processing with two-way classical communications over classical post-processing with only one-way classical communications in quantum key distribution (QKD). This is done by the explicit construction of a new protocol for (the error correction/detection and privacy amplification of) Bennett and Brassard that can tolerate a bit error rate of up to 18.9%, which is higher than what any Bennett and Brassard scheme with only one-way classical communications can possibly tolerate. Moreover, we demonstrate the advantage of the six-state scheme over Bennett and Brassard by showing that the six-state scheme can strictly tolerate a higher bit error rate than Bennett and Brassard. In particular, our six-state protocol can tolerate a bit error rate of 26.4%, which is higher than the upper bound of 25% bit error rate for any secure Bennett and Brassard protocol. Consequently, our protocols may allow higher key generation rate and remain secure over longer distances than previous protocols. Our investigation suggests that two-way entanglement purification is a useful tool in the study of advantage distillation, error correction, and privacy amplification protocols.
In this paper, we introduce the extended mean king's problem and its solutions. Also, we show a quantum key distribution (QKD) using the extended mean king's problem. By using the quantum key distribution, a sender can share a secret key with each of receivers. Besides, we consider the tolerance to an eavesdropper who makes intercept-resend attacks. As a result, in the case of two receivers, we indicate that the quantum key distribution is robust against the intercept-resend attacks by showing that the error occurs between the secret keys of a sender and receivers.