In this paper, we introduce a novel two-way quantum key distribution (QKD) protocol in which the sender (Alice) and receiver (Bob) employ one qubit of a maximally entangled Bell state as the quantum channel for key exchange. The protocol incorporates a new security mechanism based on a scrambling operator. Unlike conventional two-way QKD protocols, all sifting operations and eavesdropper detection procedures are postponed until the completion of the quantum communication stage and are performed exclusively by Bob. Since the control mode is never publicly announced, attacks that rely on mode-dependent adaptations or attempt to remain hidden within the control mode are inherently prevented. Furthermore, the traveling qubit does not directly encode key information, substantially limiting the information that can be extracted from attacks targeting the quantum channel alone. An additional distinctive feature of the protocol is that rounds that would ordinarily be discarded can instead be utilized to detect the presence of an eavesdropper. We analyze a broad class of ancilla-based attacks, in which an eavesdropper couples an ancillary system to the transmitted qubit in an attempt to gain information about the key, and show that such attacks are detectable in their most general form.
In this paper, we introduce a novel two-way quantum key distribution (QKD) protocol in which the sender (Alice) and receiver (Bob) employ one qubit of a maximally entangled Bell state as the quantum channel for key exchange. The protocol incorporates a new security mechanism based on a scrambling operator. Unlike conventional two-way QKD protocols, all sifting operations and eavesdropper detection procedures are postponed until the completion of the quantum communication stage and are performed exclusively by Bob. Since the control mode is never publicly announced, attacks that rely on mode-dependent adaptations or attempt to remain hidden within the control mode are inherently prevented. Furthermore, the traveling qubit does not directly encode key information, substantially limiting the information that can be extracted from attacks targeting the quantum channel alone. An additional distinctive feature of the protocol is that rounds that would ordinarily be discarded can instead be utilized to detect the presence of an eavesdropper. We analyze a broad class of ancilla-based attacks, in which an eavesdropper couples an ancillary system to the transmitted qubit in an attempt to gain information about the key, and show that such attacks are detectable in their most general form.
Quantum cryptography is anticipated to drive substantial advancements in cybersecurity. The impending arrival of quantum cryptography compromises current encryption methods, possibly compromising the effectiveness of traditional key management-based security protocols. One fundamental Quantum Key Distribution (QKD) protocol, BB84, encounters challenges when operating with fewer Quantum bits (Qubits) and bases that only support up to 8 Qubits. This limitation weakens the system’s security, making brute force, intercept, and resend attacks less challenging. Consequently, this study proposes a method to enhance the security of the BB84 protocol, to reduce susceptibility to attacks and eavesdropping. The improved BB84 protocol utilizes 9, 12, and 16 quantum bits along with two, and three bases to significantly bolster security. This allows authorized parties to eliminate the use of compromised keys. Additionally, the study implements the E91 QKD protocol utilizing the Entanglement Pair Generation (EPR) method to produce secure keys. While the existing E91 protocol ensures security through Bell’s theorem and Bell’s inequality, it overlooks the impact of noise, leading to inaccuracies in eavesdropper detection. To address this, the study introduces an additional security measure. Whenever an eavesdropper attempts to measure the quantum state, the proposed E91 protocol collapses its state from$\vert 10\rangle to\vert 11\rangle ,settingthefirstQubitto\vert 1\rangle andtheotherQubitto\vert 0\rangle $, thus providing the eavesdropper with incorrect information, accompanied by a phase angle of$15\pi $/8. This leads to a misconception, preventing eavesdroppers from obtaining useful details about transferred quantum states. Additionally, considering that the proposed E91 protocol relies on entangled particles and utilizes double Qubit gates, which are inherently noisier than single Qubit gates and more susceptible to quantum decoherence, this study employs error mitigation techniques during the final measurement to predict outcomes more efficiently.
Bidirectional quantum key distribution (QKD) protocols face persistent challenges related to classical disclosure, confinement of the signal space to predictable subspaces, and limited detectability under substitution or entanglement-swapping attacks. In this work, we present a Bell-state extension of the Loop-Back QKD architecture that improves efficiency and detectability while preserving its defining feature of a simplified, measurement-free remote terminal. The protocol employs entangled Bell states together with deterministic local Pauli encoding at the remote node. A central element is that Alice privately prepares and knows the initial Bell state, which serves as a hidden reference enabling her to interpret the Bell-state transition induced by Bob, while preventing an adversary from reconstructing the encoding without access to this reference. By exploiting both intra- and inter-family Bell transitions, the scheme expands the effective signal space beyond the subspace restrictions of earlier two-way protocols. Alice performs a Bell-state measurement to deterministically infer Bob's operation without any basis sifting. Although the traveling subsystem remains locally maximally mixed, concealing the initial Bell family amplifies disturbance under separable substitution strategies, yielding an intrinsic detection probability of approximately 3/4 per round. From an efficiency perspective, the protocol lifts the intrinsic post-selection limitation of single-qubit Loop-Back schemes: the effective throughput is bounded only by the Bell-state measurement success probability, reaching up to 50% in linear-optical implementations. These features make the proposed scheme particularly suitable for mobile or edge-based QKD scenarios, where passive remote nodes must operate under high loss and limited interaction times.
Abstract We propose a quantum key distribution (QKD) protocol that is carried out in an indefinite causal order (ICO). In QKD, one considers a setup in which two parties, Alice and Bob, share a key with one another in such a way that they can detect whether an eavesdropper, Eve, has learnt anything about the key. To our knowledge, in all QKD protocols proposed until now, Eve is detected by publicly comparing a subset of Alice and Bob’s key and checking for errors. We find that a consequence of our protocol is that it is possible to detect eavesdroppers without publicly comparing any information about the key. Indeed, we prove that it is not possible for eavesdroppers, performing any individual attack, to extract useful information about the shared key without inducing a nonzero probability of being detected. We also prove the security of this protocol against a class of individual eavesdropping attacks. The role ICO plays in causing unusual phenomena in quantum technologies is an important question. By considering it we find a two-way QKD protocol that exhibits a similar private detection feature, albeit with some interesting differences. After noting some implications of these differences and discussing some of the practicalities of our protocol, we conclude that this work is best considered as a first step in applying quantum cryptographic ideas in an ICO.
Abstract Several quantum key distribution (QKD) protocols employ iterative sifting. After each quantum transmission round, Alice and Bob disclose part of their setting information (including their basis choices) for the detected signals. This quantum phase then ends when the basis dependent termination conditions are met, i.e., the numbers of detected signals per basis exceed certain pre-agreed threshold values. Recently, however, Pfister et al (2016 New J. Phys. 18 053001) showed that the basis dependent termination condition makes QKD insecure, especially in the finite key regime, and they suggested to disclose all the setting information after finishing the quantum phase. However, this protocol has two main drawbacks: it requires that Alice possesses a large memory, and she also needs to have some a priori knowledge about the transmission rate of the quantum channel. Here we solve these two problems by introducing a basis-independent termination condition to the iterative sifting in the finite key regime. The use of this condition, in combination with Azuma’s inequality, provides a precise estimation on the amount of privacy amplification that needs to be applied, thus leading to the security of QKD protocols, including the loss-tolerant protocol (Tamaki et al 2014 Phys. Rev. A 90 052314), with iterative sifting. Our analysis indicates that to announce the basis information after each quantum transmission round does not compromise the key generation rate of the loss-tolerant protocol. Our result allows the implementation of wider classes of classical post-processing techniques in QKD with quantified security.
Employing the fundamental laws of quantum physics, Quantum Key Distribution (QKD) promises the unconditionally secure distribution of cryptographic keys. However, in practical realisations, a QKD protocol is only secure, when the quantum bit error rate introduced by an eavesdropper unavoidably exceeds the system error rate. This condition guarantees that an eavesdropper cannot disguise his presence by simply replacing the original transmission line with a less faulty one. Unfortunately, this condition also limits the possible distance between the communicating parties, Alice and Bob, to a few hundred kilometers. To overcome this problem, we design a QKD protocol which allows Alice and Bob to distinguish system errors from eavesdropping errors. If they are able to identify the origin of their errors, they can detect eavesdropping even when the system error rate exceeds the eavesdropping error rate. To achieve this, the proposed protocol employs an alternative encoding of information in two-dimensional photon states. Errors manifest themselves as quantum bit and as index transmission errors with a distinct correlation between them in case of intercept-resend eavesdropping. As a result, Alice and Bob can tolerate lower eavesdropping and higher system error rates without compromising their privacy.
We suggest that the randomness of the choices of measurement basis by Alice and Bob provides an additional important resource for quantum cryptography. As a specific application, we present a novel protocol for quantum key distribution (QKD) which enhances the BB84 scheme by encrypting the information sent over the classical channel during key sifting. We show that, in the limit of long keys, this process prevents an eavesdropper from reproducing the sifting process carried out by the legitimate users. The inability of the eavesdropper to sift the information gathered by tapping the quantum channel reduces the amount of information that an eavesdropper can gain on the sifted key. We further show that the protocol proposed is self sustaining, and thus allows the growing of a secret key.