Code-routing: A new attack on position verification (2023)

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

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

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

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

The garden-hose model (2013)

Studies attacks on $f$-routing and introduces garden-hose complexity to connect attacks on $f$-routing to complexity theory. Provides many first results regarding that connection, for example that any $f \in \mathsf{L}$ (with pre-processing) can be attacked efficiently