We propose a quantum protocol to authenticate classical messages that can be used to replace Wegman–Carter’s classical authentication scheme in quantum key distribution (QKD) protocols. We show that the proposed scheme achieves greater conditional entropy of the seed for the intruder given her (quantum) observation than the classical case. The proposed scheme is suitable for situations where the shared symmetric key used in authentication becomes dangerously short (due to noise or eavesdropping), and there is a threat that it might be completely consumed without being replaced. Our protocol is an improvement over a classical scheme by Brassard and takes advantage of quantum channel properties. It is motivated by information-theoretical results. We stress that the proposed authentication protocol can also be used as an independent authentication protocol that is not a part of a QKD. However by adopting it, QKD becomes a fully quantum protocol. We prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function. We conclude that the proposed quantum encoding offers more security than the classical scheme and, by applying a classical result, we show that it can be used under noisy quantum channels.
We propose a quantum protocol to authenticate classical messages that can be used to replace Wegman–Carter’s classical authentication scheme in quantum key distribution (QKD) protocols. We show that the proposed scheme achieves greater conditional entropy of the seed for the intruder given her (quantum) observation than the classical case. The proposed scheme is suitable for situations where the shared symmetric key used in authentication becomes dangerously short (due to noise or eavesdropping), and there is a threat that it might be completely consumed without being replaced. Our protocol is an improvement over a classical scheme by Brassard and takes advantage of quantum channel properties. It is motivated by information-theoretical results. We stress that the proposed authentication protocol can also be used as an independent authentication protocol that is not a part of a QKD. However by adopting it, QKD becomes a fully quantum protocol. We prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function. We conclude that the proposed quantum encoding offers more security than the classical scheme and, by applying a classical result, we show that it can be used under noisy quantum channels.
We propose a quantum-enhanced protocol to authenticate classical messages, with improved security with respect to the classical scheme introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator (PRG) and a hash function is used to create the authentication tag of a public message. We show that a quantum encoding of secret bits offers more security than the classical XOR function introduced by Brassard. Furthermore, we establish the relationship between the bias of a PRG and the amount of information about the key that the attacker can retrieve from a block of authenticated messages. Finally, we prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function.
We present a quantum-assisted data authentication protocol that integrates classical information-theoretic security with quantum communication techniques. We assume only that the participants have access to open classical and quantum channels, and share a random static key material. Building on the Wegman–Carter paradigm, our scheme employs universal hashing for message authentication and leverages quantum channels to securely transmit random nonces, eliminating the need for key recycling. The protocol utilizes polar codes within Wyner’s wiretap channel model to ensure confidentiality and reliability, even in the presence of an all-powerful adversary. Security analysis demonstrates that the protocol inherits strong guarantees from both classical and quantum frameworks, provided the quantum channel maintains low loss and noise.
Quantum authentication protocol can be used to authenticate classical messages in a secure manner. In this paper, by using the cryptographic hash function and non-orthogonal qubits, a quantum authentication protocol of classical messages is proposed. In our protocol, the classical messages and their corresponding tags are encoded as nonorthogonal qubits. The message receiver decodes the classical messages and their corresponding tags from the received qubits by using the authentication key. To verify the validity of the received classical messages, the message receiver verifies whether the hash values of the decoded classical messages are equal to the corresponding tags. Our scheme can be proved to be secure against forgery attack and measurement attack. On the other hand, the authentication key is a binary string, which can be securely obtained and easily saved. What is more, because the authentication key remains secure after executing the authentication protocol, it provides the possibility of reusing the authentication key.
The paper addresses entity authentication in quantum key distribution (QKD) systems as a decisive condition of their practical security. It is shown that the information-theoretic security of quantum key agreement does not eliminate the need to authenticate the communicating parties: an unauthenticated classical channel leaves the system exposed to the man-in-the-middle attack, since the eavesdropper can run independent QKD instances with each party and reconcile two keys under full control. Existing authentication methods are analysed and classified by the underlying cryptographic primitive: symmetric schemes based on Wegman–Carter universal hashing, pre-shared and fixed keys, public-key infrastructure, two-way authentication, quantum entity/identity authentication, and zero-knowledge proofs. For each class the operating principle, advantages and limitations are determined, with emphasis on key management, scalability and trust distribution. It is established that symmetric and quantum-layer methods rely on pre-shared secrets with a quadratic growth of key material, public-key infrastructure introduces a single trust bottleneck and quantum-vulnerable primitives, while existing zero-knowledge authentication schemes are quantum and bound to the physical layer or solve network properties other than identity. A comparative analysis reveals an unresolved scientific gap: the absence of a scalable entity-authentication method that simultaneously provides non-disclosure of the secret, quantum resistance, sub-quadratic scalability and minimisation of trust assumptions. On this basis, a prospective research direction is substantiated – the construction of entity-authentication methods based on post-quantum zero-knowledge proofs operating over the classical control plane of scalable QKD networks. The requirements for such a method are formulated, and its compatibility with formal QKD security proofs is discussed.
In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is at least twice as long as the tag. We address the question of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes. It is shown that a broad class of symmetric prepare-and-measure quantum message-authentication schemes cannot do better than their classical counterparts.
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.