We define the task of 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 Malaney and Chandran et al. 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.
As pointed out in REF , Malaney's schemes can also be broken by a teleportation-based attack.
Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
Phys. Rev. A 84, 012326 (2011)
Physics Computer Science Mathematics