• Corpus ID: 251467795

# Towards practical and error-robust quantum position verification

@inproceedings{Allerstorfer2021TowardsPA,
title={Towards practical and error-robust quantum position verification},
author={Rene Allerstorfer and Harry Buhrman and Florian Speelman and Philip Verduyn Lunel},
year={2021}
}
• Published 24 June 2021
• Computer Science
Loss of inputs can be detrimental to the security of quantum position veriﬁcation (QPV) protocols, as it may allow attackers to not answer on all played rounds, but only on those they perform well on. In this work, we study loss-tolerant QPV protocols. We propose a new fully loss-tolerant protocol QPV SWAP , based on the SWAP test, with several desirable properties. The task of the protocol, which could be implemented using only a single beam splitter and two detectors, is to estimate the…
1 Citations

## Figures from this paper

### On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification

• Computer Science
• 2022
This work constructs the first known example of a QPV protocol that is provably secure against unentangled attackers restricted to classical communication, but can be perfectly attacked by local operations and a single round of simultaneous quantum communication indicating that allowing for quantum communication may break security.

## References

SHOWING 1-10 OF 43 REFERENCES

### On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification

• Computer Science
• 2022
This work constructs the first known example of a QPV protocol that is provably secure against unentangled attackers restricted to classical communication, but can be perfectly attacked by local operations and a single round of simultaneous quantum communication indicating that allowing for quantum communication may break security.

### Enhanced No-Go Theorem for Quantum Position Verification

• Computer Science, Mathematics
• 2013
It is shown that for the general adversaries, who execute the attack operations at every common time slot or the time when they detect the arrival of the challenge signals from the verifiers, secure QPV is achievable, which implies practically secureQPV can be obtained even if the adversaries is allowed to share unlimited entanglement previously.

### Loss-tolerant quantum secure positioning with weak laser sources

• Computer Science
ArXiv
• 2016
This paper proposes a time-reversed entanglement swapping QPV protocol (based on measurement-device-independent quantum cryptography) that is highly robust against quantum channel loss and finds that the security only degrades by an additive constant and the protocol is able to verify positions up to 47 dB channel loss.

### Loss-tolerant position-based quantum cryptography

• Computer Science, Mathematics
• 2015
This paper shows that an extended BB84-type PBQC protocol implemented with a weak coherent source and realistic single photon detectors can tolerate an overall loss of 13 dB if the intrinsic quantum bit error rate is 1%.

### Insecurity of position-based quantum-cryptography protocols against entanglement attacks

• Computer Science, Mathematics
• 2011
It is shown that the existing proposals for position-based quantum cryptography are insecure if entanglement is shared among two adversaries, and a modified scheme is proposed in which the same cheating strategy used to undermine the previous protocols can succeed with a rate of at most 85%.

### Breaking simple quantum position verification protocols with little entanglement

• Physics, Computer Science
• 2020
This work considers adversaries sharing maximally entangled pairs of qudits and finds low-dimensional INQC attacks against the simple practical family of QPV protocols based on single photons polarized at an angle $\theta$.

### A monogamy-of-entanglement game with applications to device-independent quantum cryptography

• Computer Science
• 2013
This work considers a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system, and implies that the optimal guessing probability can be achieved without the use of entanglement.

### Quantum Location Verification in Noisy Channels

• R. Malaney
• Physics
2010 IEEE Global Telecommunications Conference GLOBECOM 2010
• 2010
It is found that the performance of quantum location verification is in fact similar for Bell states and some N > 2 GHZ states, even though quantum decoherence degrades larger-qubit entanglements faster.

### Position-Based Quantum Cryptography: Impossibility and Constructions

• Computer Science
SIAM J. Comput.
• 2014
This work study position-based cryptography in the quantum setting to use the geographical position of a party as its only credential and shows that if adversaries are allowed to share an arbitrarily large entangled quantum state, the task of secure position-verification is impossible.

### Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks

• Computer Science, Mathematics
ArXiv
• 2021
This work shows for the first time that there exists a quantum position veriﬁcation protocol where the ratio between the quantum Resources an honest prover needs and the quantum resources the attackers need to break the protocol is unbounded.