dogear

enter for all results · esc to close

Perfect cheating is impossible for single-qubit position verification (2024)

arxiv.orgsite

Considers a generalisation where the input qubits are eigenstates of a $\mathbb{C}^2$ projector chosen uniformly at random. Shows that no finite-dimensional resource state can perfectly attack this protocol.

from
Position-Based Quantum Cryptography
added
2026-10-10
likes
0

similar

  1. A single-qubit position verification protocol that is secure against multi-qubit attacks (2022) doi.org

    Shows a robust linear lower bound on the dimension of the attack resource state.

  2. 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.

  3. Position-based quantum cryptography: Impossibility and constructions (2011) doi.org

    Shows security against unentangled attacks.

  4. 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.

  5. On the role of quantum communication and loss in attacks on quantum position verification (2022) arxiv.org

    Proves a 3/4 upper bound on the success probability of unentangled attacks.

  6. Simplified instantaneous non-local quantum computation with applications to position-based cryptography (2011) doi.org

    Provides a general attack on QPV based on port-based teleportation, using an exponential amount of pre-shared EPR pairs in the number of input qubits. Also provides a QPV protocol with a provably linear lower bound.

Position-Based Quantum Cryptography › First Protocols > BB84 QPV and Generalisations: “Considers a generalisation where the input qubits are eigenstates of a $\mathbb{C}^2$ projector chosen uniformly at random. Shows that no finite-dimensional resource state can perfectly attack this protocol.”