Position-Based Quantum Cryptography
51 items from renaller/awesome-position-based-quantum-cryptography ★26
-
Holographic scattering requires a connected entanglement wedge (2020) doi.org
Furthers the connection between QPV and holography and estimates the mutual information between the relevant boundary regions. Results based on the conjecture could yield efficient attacks on all QPV protocols due to the results in this paper.
-
Quantum position verification in the random oracle model (2014) doi.org
Considers QPV in higher dimensions carefully and shows unconditional security in the random oracle model.
-
Position-based cryptography (2009) doi.org
Establishes classical impossibility of position-based cryptography in the vanilla model. Explores possibility in the bounded-storage model.
-
Quantum Secure Key Exchange with Position-based Credentials (2025) arxiv.org
Improved analysis of how to use QPV to provide the authentication within QKD.
-
A complexity theory for non-local quantum computation (2025) arxiv.org
Finds relations between a wide range of different NLQC tasks, including showing that $f$-routing and $f$-BB84 are equivalent, with a constant-overhead reduction between them.
-
Perfect cheating is impossible for single-qubit position verification (2024) arxiv.org
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.
-
Continuous-variable quantum position verification secure against entangled attackers (2024) arxiv.org
Generalises $f$-BB84 QPV to continuous-variable inputs and shows analogous security statements as for finite-dimensional inputs.
-
Linear gate bounds against natural functions for position-verification (2024) arxiv.org
Provides a robust linear lower bound on the number of quantum gates/measurements needed to attack the inner product function.
-
Rank lower bounds on non-local quantum computation (2024) arxiv.org
Provides a lower bound in terms of the Schmidt-rank of the resource state for perfect attacks. Gives linear lower bounds for some concrete functions.
-
Introduces an extra commitment step into QPV and shows that for a class of protocols, involving $f$-BB84 QPV, this makes the transmission loss irrelevant for security. Argues $f$-BB84 is a practical QPV protocol.
-
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…
-
Monogamy of highly symmetric states (2023) arxiv.org
The results in this paper imply a $\ln(2) \approx 0.69$ upper bound on the success probability of unentangled attacks.
-
Towards practical quantum position verification (2023) arxiv.org
Delves into some technical hardware details of a practical QPV implementation.
-
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.
-
Holography as a resource for non-local quantum computation (2022) arxiv.org
Discusses and fills a loophole in the paper one above. Costructs an attacked based on simulating a holographic CFT and argues that, based on some assumptions, any polynomially complex unitary can be efficiently attacked.
-
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.
-
Non-local computation of quantum circuits with small light cones (2022) arxiv.org
Provides a general attack on QPV based on the geometric structure of a circuit decomposition of the task unitary. Is more efficient for certain classes of unitaries than previous general attacks.
-
Towards practical and error-robust quantum position verification (2021) arxiv.org
Defines a new protocol based on the SWAP test and studies it theoretically and practically.
-
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.
-
Constraining the doability of relativistic quantum tasks (2019) arxiv.org
Generalises the port-based attack to more general quantum tasks and spacetime circuits. Finds that the coarse causal structure of the task is the relevant property determining whether the task is doable non-locally.
-
A tight lower bound for the BB84-states quantum-position-verification protocol (2015) arxiv.org
Gives essentially tight lower bound for attacks with classical communication.
