Abstract

We discuss quantum position verification (QPV) protocols in which the verifiers create and send single-qubit states to the prover. QPV protocols using single-qubit states are known to be insecure against adversaries that share a small number of entangled qubits. We introduce QPV protocols that are practically secure: they only require single-qubit states from each of the verifiers, yet their security is broken if the adversaries sharing an impractically large number of entangled qubits employ teleportation-based attacks. These protocols are a modification of known QPV protocols in which we include a classical random oracle without altering the amount of quantum resources needed by the verifiers. We present a cheating strategy that requires a number of entangled qubits shared among the adversaries that grows exponentially with the size of the classical input of the random oracle.

Highlights

  • Suppose that a security organization would like to identify the position of its spy in a secure location, who could possibly be surrounded by adversaries, before initiating any distant private communication

  • The security organization could execute a protocol whose task is to use the spatial position of the spy as its only credential that has to be verified by the organization

  • We introduced new schemes for quantum position verification protocols by introducing a classical random oracle

Read more

Summary

INTRODUCTION

Suppose that a security organization would like to identify the position of its spy in a secure location, who could possibly be surrounded by adversaries, before initiating any distant private communication. By using the best-known teleportation-based attack strategies [5, 11], we show that the number of entangled qubits that need to be shared among the adversaries in order to breach security grows exponentially with the size of the classical input of the random oracle. These protocols appear to be practically secure under the attack of colluding adversaries sharing a large amount of entangled pairs (exponentially growing with the length of classical information), even though each verifier sends just one qubit to the prover to execute the QPV protocol.

QUANTUM POSITION VERIFICATION
Protocols with single-qubit states
One-qubit protocol
Modified one-qubit protocol
Two-qubit protocol
Modified two-qubit protocol
PROTOCOLS WITH SINGLE-QUBIT STATES AND CLASSICAL RANDOM ORACLE
One-qubit protocol with a classical random oracle
Two-qubit protocol with classical random oracle
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call