Towards practical quantum position verification
George Cowperthwaite, Adrian Kent, Damian Pitalua-Garcia

TL;DR
This paper presents practical quantum position verification protocols that rely on classical data security and quantum key distribution, avoiding quantum communication and enabling feasible implementation with current technology.
Contribution
It introduces quantum position verification schemes that are practical, secure against spoofing, and do not require quantum communication, using classical data security and quantum key distribution.
Findings
Schemes are secure against non-local spoofing attacks.
Protocols are practical with current technology.
Allow for errors and losses in implementation.
Abstract
We discuss protocols for quantum position verification schemes based on the standard quantum cryptographic assumption that a tagging device can keep classical data secure [Kent, 2011]. Our schemes use a classical key replenished by quantum key distribution. The position verification requires no quantum communication or quantum information processing. The security of classical data makes the schemes secure against non-local spoofing attacks that apply to schemes that do not use secure tags. The schemes are practical with current technology and allow for errors and losses. We describe how a proof-of-principle demonstration might be carried out.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
