continuous-variable protocols 1convex optimization 1distance fraud 1mafia fraud 1quantum distance bounding 1semidefinite programming 1
From the 1 of 3 linked papers with an AI index.
3 papers
quant-ph2026
Robust logarithmic lower bound on shared-resource cost for -routing
Kevin Bogner
In one-round -routing, Alice receives an -bit string and an unknown qubit, while Bob receives a separate -bit string . A Boolean function determines the recipie…
quant-ph2026
Security evaluation of quantum distance-bounding protocols via semidefinite programming
Kevin Bogner, Aysajan Abidin, Dave Singelee +1
The paper analyzes the security of quantum distance‑bounding protocols by formulating one‑round distance‑fraud and mafia‑fraud attacks as convex optimization problems that can be s…
quant-ph2026
Security Framework for Quantum Distance-Bounding
Kevin Bogner, Aysajan Abidin, Dave Singelee +1
Distance-bounding (DB) protocols let a verifier upper-bound a prover's physical distance by timing rapid challenge-response exchanges. Quantum communication promises simpler DB pro…