Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1008.2147 v6 pith:F72MW7SQ submitted 2010-08-12 quant-ph cs.CRcs.ITmath.IT

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

classification quant-ph cs.CRcs.ITmath.IT
keywords quantumprotocolstaggingattacksauthenticatingbrokenclassicalconsidered
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.