quantum cryptography

Efficient Multi-basis Quantum Position Verification Secure against Generalized Adversaries

arXiv:2506.03549

summary

The paper proposes a robust quantum position verification protocol that tolerates channel loss, refines security analysis against experimental imperfections, and demonstrates its use for authenticating classical communication in quantum key distribution.

Abstract

Quantum position verification (QPV) enables multiple verifiers to certify a prover's location using quantum communication and physical assumptions. With experimental demonstrations of QPV becoming increasingly feasible, enhancing the practicality and security of QPV protocols is more important than ever. In this work, we make three key contributions toward this goal. First, we introduce a robust QPV protocol in which the verifier's state preparation is independent of channel loss, improving reliability in real-world conditions. Second, we refine existing security analysis techniques to bolster protocol resilience against experimental imperfections. Third, we identify and address some implicit assumptions present in existing security analyses, providing a framework to eliminate such assumptions. Additionally, as an example of QPV application beyond location verification, we illustrate how QPV can be leveraged for authenticating classical communication in quantum key distribution.

Topics & keywords

#quantum position verification#security analysis#channel loss tolerance#quantum key distribution#authenticationQPVloss-tolerant protocoladversarial modelclassical authenticationrobust state preparation
Efficient Multi-basis Quantum Position Verification Secure against Generalized Adversaries · wovepaper