This paper reviews how to prove who sent data and that it was not changed in networks that carry quantum information. The authors separate three different tasks that are often mixed up: authenticating classical messages, authenticating quantum messages, and authenticating the identity of a party (entity authentication). Their main point is simple: quantum communication does not remove the need for authentication. Every secure quantum protocol depends on a specific authentication resource, and the security claim only makes sense once that resource and how it is deployed are stated explicitly.

To reach this conclusion the authors collect and compare representative protocols for each of the three tasks. They judge schemes by their security assumptions, the initial set-up they require, whether they compose cleanly with other protocols, and whether they scale to large or changing networks. They also cover recent hardware-assisted approaches and give a detailed case study of authentication in quantum key distribution (QKD). Where possible the survey identifies approaches that are suitable for different use cases under these criteria.

A concrete example in the review is the BB84 QKD protocol. In BB84 one party prepares quantum states and the other measures them; afterwards they discuss which settings they used over a classical channel and keep the matching results to form a key. That classical discussion must be authenticated. The authors cite practical policy debates that treat this as a critical point: if the classical messages are not authentic, the security of the whole key exchange is void. The review notes that some authorities say source authentication for QKD requires either public-key (asymmetric) cryptography or preplaced secret keys.

The paper also explains key technical ideas behind authentication, in plain terms. Unforgeability means outsiders should not be able to create a valid message-and-tag pair that the receiver accepts. Integrity means any change to a sent message should be detected. Identity misbinding is the risk that verification is calibrated to the wrong party. Public verifiability allows anyone to run the verification test, while non-malleability says that an attacker should not be able to alter an encrypted message in a way that produces a useful change to the underlying plaintext. Importantly for quantum data, the authors note that authenticating unknown quantum states typically forces encryption as well. They distinguish unconditional security — which holds no matter how powerful an attacker is but often needs costly resources like single-use secret keys — from conditional, computational security.