Quantum key distribution (QKD) can provide information theoretically secure key exchange even in the era of quantum computer. However, QKD requires the classical channel to be authenticated, and the current method is pre-sharing symmetric keys. For a QKD network of $n$ users, this method requires $C_n^2 = n(n-1)/2$ pairs of symmetric keys to realize pairwise interconnection. In contrast, with the help of mature public key infrastructure (PKI) and post-quantum cryptography (PQC) with quantum resistant security, each user only needs to apply for a digital certificate from certificate authority (CA) to achieve efficient and secure authentication for QKD. We only need to assume the short-term security of the PQC algorithm to achieve the long-term security of the distributed keys. Here, we experimentally verified the feasibility, efficiency and stability of the PQC algorithm in QKD authentication, and demonstrated the advantages when new users join the QKD network. Using PQC authentication we only need to believe the CA is safe, rather than all trusted relays. QKD combined with PQC authentication will greatly promote and extend the application prospects of quantum safe communication.
Quantum key distribution (QKD) can provide information theoretically secure key exchange even in the era of quantum computer. However, QKD requires the classical channel to be authenticated, and the current method is pre-sharing symmetric keys. For a QKD network of n users, this method requires Cn2=n(n−1)/2 pairs of symmetric keys to realize pairwise interconnection. In contrast, with the help of mature public key infrastructure (PKI) and post-quantum cryptography (PQC) with quantum resistant security, each user only needs to apply for a digital certificate from certificate authority (CA) to achieve efficient and secure authentication for QKD. We only need to assume the short-term security of the PQC algorithm to achieve the long-term security of the distributed keys. Here, we experimentally verified the feasibility, efficiency and stability of the PQC algorithm in QKD authentication, and demonstrated the advantages when new users join the QKD network. Using PQC authentication we only need to believe the CA is safe, rather than all trusted relays. QKD combined with PQC authentication will greatly promote and extend the application prospects of quantum safe communication.
Abstract Quantum key distribution (QKD) can provide information theoretically secure key exchange even in the era of quantum computers. However, QKD requires the classical channel to be authenticated, the current method for which is pre-sharing symmetric keys. For a QKD network of n users, this method requires Cn2=n(n−1)/2 C n 2 = n ( n − 1 ) / 2 pairs of symmetric keys to realize pairwise interconnection. In contrast, with the help of a mature public key infrastructure (PKI) and post-quantum cryptography (PQC) with quantum-resistant security, each user only needs to apply for one digital certificate from a certificate authority (CA) to achieve efficient and secure authentication for QKD. We need to assume only the short-term security of the PQC algorithm to achieve long-term security of the distributed keys. Here, we experimentally verified the feasibility, efficiency, and stability of the PQC algorithm in QKD authentication, and demonstrated the advantages when new users join the QKD network. Using the PQC public-key infrastructure, the nodes need to mutually trust only the CA to authenticate each other. QKD combined with PQC authentication will greatly promote and extend the application prospects of quantum-safe communication.
With the development of quantum computers, traditional cryptographic systems are facing more and more serious security threats. Fortunately, quantum key distribution (QKD) and post-quantum cryptography (PQC) are two cryptographic mechanisms with quantum-resistant security, and both will become important solutions for future information security. However, neither of them is perfect, and they are complementary. Quantum key distribution has unconditional security that post-quantum cryptography does not have, and PQC can provide secure and convenient authentication for QKD networks. In this paper, we propose two protocols based on PQC to realize the full authentication of the QKD data post-processing, and we only need to assume the short-term security of PQC algorithm to ensure the long-term quantum resistant security of distributed keys. We found that for the above two authentication protocols, attackers cannot successfully implement replay attacks. These authentication protocols can solve the problems of the current pre-shared key authentication in the application of large-scale quantum key distribution networks, and are expected to realize a key distribution mechanism with practical operability and quantum resistant security, which will be beneficial to promote the deployment and application of quantum key distribution networks.
Quantum key distribution (QKD) provides information theoretically secure key exchange requiring authentication of the classic data processing channel via pre-sharing of symmetric private keys to kick-start the process. In previous studies, the lattice-based post-quantum digital signature algorithm Aigis-Sig, combined with public-key infrastructure (PKI), was used to achieve high-efficiency quantum security authentication of QKD, and we have demonstrated its advantages in simplifying the MAN network structure and new user entry. This experiment further integrates the PQC algorithm into the commercial QKD system, the Jinan field metropolitan QKD network comprised of 14 user nodes and 5 optical switching nodes, and verifies the feasibility, effectiveness and stability of the post-quantum cryptography (PQC) algorithm and advantages of replacing trusted relays with optical switching brought by PQC authentication large-scale metropolitan area QKD network. QKD with PQC authentication has potential in quantum-secure communications, specifically in metropolitan QKD networks.
Large quantum computers will be able to break the cryptographic algorithms on which current secure communications rely on. Post-Quantum Cryptography (PQC) and Quantum key distribution (QKD) are two security technologies that show protection capabilities against the latent quantum threat. While PQC relies on different hard mathematical problems to develop a wide variety of cryptographic operations, QKD is based on quantum physics laws to generate and distribute symmetric cryptographic keys through different QKD protocols. These keys can be used by different applications to perform security transformations. QKD still requires authentication to prevent man-in-the-middle attacks. The hybridization of PQC and QKD is an important step for future secure infrastructures, being able to provide long-term security. In this work we propose authenticated QKD approaches that rely on pre-shared keys and hybrid PQC/QKD alternatives and which are able to securely exchange secret QKD keys through authenticated channels. We identify the different configuration alternatives and their parameters, as well as we develop a wide performance evaluation. Results show that pre-shared keys and PQC-based authentication through Dilithium algorithm are the fastest alternatives. Also, we show the potential of the T12 QKD protocol.
Post-quantum cryptography (PQC) and quantum key distribution (QKD) address the quantum threat from opposite directions: PQC replaces vulnerable public-key algorithms with schemes believed to resist quantum cryptanalysis, while QKD derives keys whose secrecy rests on physical assumptions rather than computational ones. Because each approach has a distinct failure mode, a growing body of work combines them so that a session key remains secure if either component holds. We first establish the deployed baseline, hybrid classical-plus-PQC key exchange, against which QKD-augmented designs must be judged. We then propose a taxonomy of hybrid PQC-QKD designs along eight dimensions (integration layer, combiner construction, authentication scope and source, QKD topology, trusted entities, key-delivery interface, classical component, and evidence type), and use it to compare published protocols, including Muckle and its successors, MACsec and TLS integrations, and IKEv2 mechanisms standardised in RFCs 8784, 9370, and 9867. We examine key-combiner constructions in light of the KEM-combiner literature and of NIST, ETSI, and ITU-T guidance, and map the security arguments for hybrid PQC-QKD protocols onto a common grid of security model, assumptions, permitted compromise, established guarantee, and limitations. We synthesise deployment evidence from metropolitan and national QKD networks, distinguishing the few testbeds that have run PQC in the key path from pure-QKD deployments, and summarise the standards and policy landscape, including the positions of national security agencies that recommend against relying on QKD alone. We close with open problems: authentication of the QKD classical channel, shared-infrastructure threat models, device certification versus formal proofs, formal verification of hybrid handshakes, and the lack of peer-reviewed deployment economics.
Once a cryptographically relevant quantum computer is built, confidential information that is communicated today can be decrypted and exposed. Key exchange methods currently used can then be broken and the key used to protect the data can be recovered. Depending on the duration for which information needs to remain confidential, quantum-safe solutions have to be used now to protect data transmitted today. In this paper, we review recent advances in integrating the combination of two different quantum-safe solutions, Quantum Key Distribution (QKD) and Post-Quantum Cryptography (PQC), in existing protocols. We also combine classical cryptography, PQC and QKD to securely exchange a key that remains secure even if only one of the three key exchange methods is secure. This is one of the first steps to update existing communication methods such that they remain secure even if only one of PQC, QKD or classical cryptography is secure.