Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints

We define the task of {\it quantum tagging}, that is, authenticating the classical location of a classical tagging device by sending and receiving quantum signals from suitably located distant sites, in an environment controlled by an adversary whose quantum information processing and transmitting power is unbounded. We define simple security models for this task and briefly discuss alternatives. We illustrate the pitfalls of naive quantum cryptographic reasoning in this context by describing several protocols which at first sight appear unconditionally secure but which, as we show, can in fact be broken by teleportation-based attacks. We also describe some protocols which cannot be broken by these specific attacks, but do not prove they are unconditionally secure. We review the history of quantum tagging protocols, which we first discussed in 2002 and described in a 2006 patent (for an insecure protocol). The possibility has recently been reconsidered by other authors. All the more recently discussed protocols of which we are aware were either previously considered by us in 2002-3 or are variants of schemes then considered, and all are provably insecure.

💡 Research Summary

The paper introduces and rigorously examines the concept of “quantum tagging,” a cryptographic task that aims to authenticate the classical location of a tagging device by exchanging quantum signals with spatially separated verifiers. The authors first formalize the problem: two or more trusted verifiers, positioned at known locations, send quantum states (and possibly accompanying classical information) toward a tag whose position is to be verified. The tag is assumed to be a purely classical device that can receive, process, and resend signals, but it does not possess any secret key. The adversary, however, is given an extremely powerful model – unlimited quantum computational resources, the ability to control the entire region surrounding the tag, and unrestricted quantum communication capabilities. Two simple security models are defined. Model 1 assumes only the relativistic speed‑of‑light constraint on signal propagation, with no synchronized clocks among verifiers. Model 2 adds the assumption that verifiers share perfectly synchronized clocks and can measure distances with arbitrary precision, allowing them to enforce strict timing constraints on any response from the tag.

Within these models the authors survey several protocols that have been proposed in the literature, many of which appear “unconditionally secure” at first glance because they rely on the no‑cloning theorem and the impossibility of superluminal signaling. The first class of protocols is the “reflection” scheme, where the tag merely reflects incoming quantum particles back to the sender; the round‑trip time is used to infer the tag’s location. The second class involves the tag measuring an incoming quantum state and then sending a classical result back (“measure‑and‑resend”). A third class exchanges entangled states between verifiers and the tag, using correlations to certify position.

The core contribution of the paper is to demonstrate that all of these intuitive schemes are vulnerable to teleportation‑based attacks. By pre‑sharing entanglement between two points surrounding the tag, an adversary can perform a Bell‑state measurement on the incoming quantum signal, instantly teleport the state to a remote location, and reconstruct the required response within the timing window expected by the verifiers. Because teleportation does not require the physical transfer of the particle itself, the relativistic speed‑of‑light constraint is effectively bypassed. The authors provide explicit attack constructions for each protocol: for the reflection scheme the attacker redirects the incoming photon to a distant node that performs the teleportation and returns a simulated reflection; for the measure‑and‑resend scheme the attacker teleports the quantum state, measures it at the remote node, and forwards the classical outcome; for entanglement‑exchange protocols the attacker uses entanglement swapping to produce the necessary correlations without the tag’s involvement. In each case the verifiers receive responses that satisfy their timing checks, leading them to falsely accept the tag’s claimed location.

The paper also proposes a few modified protocols that seem resistant to the specific teleportation attacks described. These variants introduce more intricate dependencies between quantum and classical messages, or require the tag to perform operations that cannot be trivially reproduced by teleportation alone. However, the authors acknowledge that they have not proved unconditional security for these schemes; they merely show that the known attacks do not directly apply.

A historical overview follows: the authors first raised the quantum‑tagging idea in 2002 and filed a 2006 patent describing an insecure protocol. Recent work by other groups has revisited the problem, but according to the authors every newly proposed protocol is either a direct re‑use of their earlier ideas or a minor variation, and all are provably insecure against teleportation‑based attacks.

The conclusion emphasizes a broader lesson: combining quantum information with relativistic signaling constraints does not automatically yield secure position‑verification schemes. The existence of quantum teleportation, which can relocate quantum information instantaneously (subject to classical communication latency), undermines many naive security arguments. Future research must either restrict the adversary’s capabilities (e.g., bounded quantum memory, limited entanglement distribution) or devise fundamentally new physical assumptions that prevent teleportation from being exploited. Only under such refined models can one hope to achieve truly unconditional security for quantum tagging.