2015/05/07 by Muhammad Nadeem, Nadeem, Muhammad
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.1505.01839
12 Page, 3 figure
arxiv created 2015/05/07 · openalex publication_date 2015/05/07 · arxiv updated 2015/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Secure positioning, a prover located at a specified position convinces a set of verifiers at distant reference stations that he/she is indeed at the specific position, is considered to be impossible if the prover and verifiers have no pre-shared data while dishonest provers have an arbitrary amount of pre-shared entanglement [Nature 479, 307-308 (2011)]. We argue here that current impossibility results for secure positioning are the upshot of not utilizing full powers of relativistic quantum information theory and show that secure positioning and hence position-based quantum cryptography is possible if causal structure of Minkowski space time and quantum non-locality is used properly.