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

Relating non-local quantum computation to information theoretic cryptography (2023)

Connects $f$-routing to topics in classical cryptography, in particular conditional disclosure of secrets. Shows a sub-exponential upper bound for attacks for any $f$ and finds an $f$ that is believed to be outside of $\mathsf{P}$ (with pre-processing), but efficiently attacked

Quantum position verification in the random oracle model (2014)

Considers QPV in higher dimensions carefully and shows unconditional security in the random oracle model

Rank lower bounds on non-local quantum computation (2024)

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

Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers (2023)

Tightly characterises the secure region of the protocol depending on the loss and error rates