This paper shows that the random privacy amplification is secure with a higher key rate than Mayers' evaluation at the same error rate in the BB84 protocol with one-way or two-way classical communications. There exists only Mayers' evaluation on the secure key rate with random privacy amplification that is applicable to the BB84 protocol with two-way classical communications. Our result improves the secure key rate of the random privacy amplification in the BB84 protocol with two-way classical communications.
This paper shows that the random privacy amplification is secure with a higher key rate than Mayers' evaluation at the same error rate in the BB84 protocol with one-way or two-way classical communications. There exists only Mayers' evaluation on the secure key rate with random privacy amplification that is applicable to the BB84 protocol with two-way classical communications. Our result improves the secure key rate of the random privacy amplification in the BB84 protocol with two-way classical communications.
Privacy amplification is a necessary step in all quantum key distribution protocols, and error correction is needed in each except when signals of many photons are used in the key communication in quantum noise approach. No security analysis of error correcting code information leak to the attacker has ever been provided, while an ad hoc formula is currently employed to account for such leak in the key generation rate. It is also commonly believed that privacy amplification allows the users to at least establish a short key of arbitrarily close to perfect security. In this paper we show how the lack of rigorous error correction analysis makes the otherwise valid privacy amplification results invalid, and that there exists a limit on how close to perfect a generated key can be obtained from privacy amplification. In addition, there is a necessary tradeoff between key rate and security, and the best theoretical values from current theories would not generate enough near-uniform key bits to cover the message authentication key cost in disturbance-information tradeoff protocols of the BB84 variety.
Quantum key distribution (QKD) is a method that enables secure communication between two parties by applying the ideas of quantum physics. By minimizing information leakage that can happen during the key generation process, privacy amplification is a technique used to improve the security of QKD. The technique involves processing the raw key obtained from QKD through a randomization procedure to remove any residual information that may have been leaked during the quantum transmission. While privacy amplification can significantly improve the security of QKD, the effectiveness of the technique is limited by the quality of the initial raw key. The BB84 QKD protocol has been improved with the proposed En-BB84 protocol, which includes built-in authentication and integrity checks. The En-BB84 protocol ensures secure distribution of secret keys and protects against tampering by attackers. Key distillation and error correction techniques are employed to extract a shorter, more secure shared secret key and correct errors introduced during qubit transmission. The protocol utilizes a four-state QKD approach, expanding on the traditional two-state scheme of BB84. A simulation of the En-BB84 protocol is demonstrated using a quantum circuit implemented with Qiskit in Python. The circuit employs various gates and operations, including Hadamard, CX, controlled swap, and RZ gates, to achieve encoding and error correction. Furthermore, we have designed a better protocol with improved error rates by incorporating improvisations on the BB84 protocol. Experimental results indicate the successful integration of the B92 error correction scheme into the modified BB84 protocol, enhancing the security and performance of QKD systems.
The privacy amplification term, of which the lower bound needs to be estimated with the decoy-state method, plays a positive role in the secure key rate formula for decoy-state quantum key distribution. In previous work, the yield and the bit error rate of single-photon state are estimated separately to gain this lower bound. In this work, we for the first time take the privacy amplification term as a whole to consider this lower bound. The mathematical description for the correlation between the yield and the bit error rate of single-photon state is given with just two unknown variables. Based on this, we obtain the global estimation of this lower bound for both BB84 protocol and measurement-device-independent protocol. The results of numerical simulation show that the global estimation can significantly improve the performance of quantum key distribution.
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 a standard quantum key distribution (QKD) scheme such as BB84, two procedures, error correction and privacy amplification, are applied to extract a final secure key from a raw key generated from quantum transmission. To simplify the study of protocols, it is commonly assumed that the two procedures can be decoupled from each other. While such a decoupling assumption may be valid for individual attacks, it is actually unproven in the context of ultimate or unconditional security, which is the Holy Grail of quantum cryptography. In particular, this means that the application of standard efficient two-way error-correction protocols like Cascade is not proven to be unconditionally secure. Here, I provide the first proof of such a decoupling principle in the context of unconditional security. The method requires Alice and Bob to share some initial secret string and use it to encrypt their communications in the error correction stage using one-time-pad encryption. Consequently, I prove the unconditional security of the interactive Cascade protocol proposed by Brassard and Salvail for error correction and modified by one-time-pad encryption of the error syndrome, followed by the random matrix protocol for privacy amplification. This is an efficient protocol in terms of both computational power and key generation rate. My proof uses the entanglement purification approach to security proofs of QKD. The proof applies to all adaptive symmetric methods for error correction, which cover all existing methods proposed for BB84. In terms of the net key generation rate, the new method is as efficient as the standard Shor-Preskill proof.