A single-qubit position verification protocol that is secure against multi-qubit attacks
arXiv:2104.06301 · doi:10.1038/s41567-022-01577-0
Abstract
The position of a device or agent is an important security credential in today's society, both online and in the real world. Unless in direct proximity, however, the secure verification of a position is impossible without further assumptions. This is true classically, but also in any future quantum-equipped communications infrastructure. We show in this work that minimal quantum resources, in the form of a single qubit, combined with classical communication are sufficient to thwart quantum adversaries that pretend to be at a specific position and have the ability to coordinate their action with entanglement. More precisely, we show that the adversaries using an increasing amount of entanglement can be combatted solely by increasing the number of classical bits used in the protocol. The presented protocols are noise-robust and within reach of current quantum technology.
29 pages, 4 figures. Updated to match the journal version
References in corpus (8)
- Conjectured Strong Complementary Information Tradeoff
- Location-Dependent Communications using Quantum Entanglement
- Insecurity of position-based quantum cryptography protocols against entanglement attacks
- Loss-tolerant position-based quantum cryptography
- Geometry of Banach spaces: a new route towards Position Based Cryptography
- A Tight Lower Bound for the BB84-states Quantum-Position-Verification Protocol
- Loss-tolerant quantum secure positioning with weak laser sources
- Breaking simple quantum position verification protocols with little entanglement
Cited by in corpus (10)
- Quantum cryptography beyond key distribution: theory and experiment
- Relating non-local quantum computation to information theoretic cryptography
- Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers
- Code-routing: a new attack on position verification
- Linear gate bounds against natural functions for position-verification
- Towards efficient and secure quantum-classical communication networks
- Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss
- Continuous-variable Quantum Position Verification secure against entangled attackers
- Conditional disclosure of secrets with quantum resources
- Impossibility of perfect cheating for single-qubit position verification