QKD occurs over two communication channels: classical and quantum. While the quantum channel is somewhat secure by quantum principles, the classical channel need to be authenticated using cryptographic algorithms. Unfortunately, the authentication algorithms and the methods suggested are not taking into consideration the problems practical implementations are facing. Moreover, there are areas which has not been discussed by the literature such as the quantum application layer in communication over classical channel. This study identifies the hurdles practical implementations of QKD are facing and proposes a solution which take into consideration these needs. Moreover, it suggests new protocols and approaches suitable for QKD post processing authentication.
QKD occurs over two communication channels: classical and quantum. While the quantum channel is somewhat secure by quantum principles, the classical channel need to be authenticated using cryptographic algorithms. Unfortunately, the authentication algorithms and the methods suggested are not taking into consideration the problems practical implementations are facing. Moreover, there are areas which has not been discussed by the literature such as the quantum application layer in communication over classical channel. This study identifies the hurdles practical implementations of QKD are facing and proposes a solution which take into consideration these needs. Moreover, it suggests new protocols and approaches suitable for QKD post processing authentication.
In this review, we survey the cryptographic task of authentication from the perspective of quantum communication. We review three main flavours of authentication that are often conflated in the literature: authentication of classical messages, authentication of quantum messages, and entity authentication, also covering recent hardware-assisted approaches. We compare representative protocols for each functionality in terms of their security assumptions, set-up requirements, composability, and scalability in large or dynamic networks, and use these criteria to identify and recommend suitable candidates. Finally, applications are surveyed: we provide a detailed case study of authentication and quantum key distribution (QKD), then extend the discussion to protocols beyond QKD, where the role of authentication is more complex. Our take-home message is that an authentication requirement is not an intrinsic limitation of quantum networks: as with all secure communication, each protocol relies on a particular authentication resource, and the security claim of that protocol is meaningful only once the authentication resource and its deployment assumptions are made explicit. At the same time, the existing classical and quantum literature already offers a range of quantum-secure authentication schemes, which can support different applications when carefully matched to the required functionality, assumptions, and security guarantees.
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.
In this article, we investigate the issue of authenticating the classical post-processing components of a QKD protocol through an insecure channel. Our analysis starts with state-of-the-art solutions and subsequently introduces an authentication scheme aiming at both Information Theoretic Security and resiliency from particular denial-of-service attacks targeting the authentication procedure. The proposed strategy combines -Almost Strongly Universal hashing for unconditional protection and computationally-secure Message Authentication Codes for DoS detection capability. Specifically, we consider the protocol security in a typical QKD scenario, taking into account partially weak authentication keys. Moreover, we add practical considerations related to authentication parameters and experimentally evaluate the performance of the proposed system in terms of computational complexity and key consumption in a reasonable use case.
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.
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.
Quantum key distribution (QKD) is the most extensively researched quantum cryptographic protocol, leveraging quantum phenomena to enable information-theoretically secure key establishment. Conventional QKD systems rely on authenticated classical post-processing channels to prevent impersonation attacks. However, QKD inherently lacks authentication capabilities, necessitating an external authentication mechanism. Furthermore, the classical post-processing steps introduce information leakage, exposing QKD to additional attack strategies and diminishing the final key rate. In this study, we introduce a novel QKD protocol that eliminates the need for separate authentication, prevents information leakage, and significantly improves the achievable key rate. By removing public classical channels entirely, our design attains perfect secrecy with the use of two reusable pre-shared keys.