On the role of quantum communication and loss in attacks on quantum position verification (2022)
Proves a 3/4 upper bound on the success probability of unentangled attacks.
- from
- Position-Based Quantum Cryptography
- added
- 2026-10-10
- likes
- 0
similar
-
On the role of quantum communication and loss in attacks on quantum position verification (2022) arxiv.org
Shows that any QPV protocol that can be broken unentangled with quantum communication, but is secure against classical communication attacks, can be transformed into one that is secure against quantum communication attacks. Also notes that if the signal loss is high enough any…
-
Position-based quantum cryptography: Impossibility and constructions (2011) doi.org
Shows security against unentangled attacks.
-
Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers (2023) doi.org
Tightly characterises the secure region of the protocol depending on the loss and error rates.
-
Breaking simple quantum position verification protocols with little entanglement (2020) arxiv.org
Considers the case when the input bases are related by different angles and shows dimension-dependent attacks depending on the angle. Notably, they show the angle $\pi/6$ (outside the Clifford hierarchy) can be attacked with a 6-dimensional resource state.
-
Security of a continuous-variable based quantum position verification protocol (2023) arxiv.org
Generalises the protocol to continuous variable inputs and shows security against unentangled attacks depending on loss and noise rates.
-
Insecurity of position-based quantum cryptography protocols against entanglement attacks (2011) doi.org
Proves insecurity of QPV protocols that were previously claimed secure and studies general principle underlying entanglement attacks. Studies variations of QPV protocols based on Bell/GHZ states and shows that using eigenstates other than Pauli $X$, $Y$, $Z$ leads to protocols…
Position-Based Quantum Cryptography › First Protocols > Bell QPV: “Proves a 3/4 upper bound on the success probability of unentangled attacks.”