Classical Verifier Position Verification from Non-Local Games

@misc{kon2026classical,
  title = {{Classical Verifier Position Verification from Non-Local Games}},
  author = {Wen Yu Kon and Fatih Kaleoglu and Kaushik Chakraborty},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.38441},
  eprint = {2609.38441},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.38441},
  note = {CC BY 4.0},
}

TY  - UNPB
TI  - Classical Verifier Position Verification from Non-Local Games
AU  - Wen Yu Kon
AU  - Fatih Kaleoglu
AU  - Kaushik Chakraborty
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.38441
UR  - https://arxiv.org/abs/2609.38441
AB  - Secure position verification certifies that a remote prover occupies a claimed location, a task that is provably impossible with classical resources alone against colluding adversaries. Most existing quantum position verification schemes require transmitting quantum states between verifiers and provers, and the resulting photon loss makes long-distance verification impractical. Classical verifier position verification (CVPV) schemes with classical verifier-prover communication exist, but rely on complex quantum processes that generate certifiable randomness, placing them outside the reach of near-term hardware. Here we introduce a general compiler that maps any complete-support non-local game with the required quantum advantage into a multi-prover CVPV protocol. This addresses both limitations, with entirely classical verifier-prover communication and all quantum resources confined to shared entanglement and local measurements on the prover devices. Instantiating with the CHSH game enables near-term implementation on existing experimental platforms. We prove finite-size security in the quantum random oracle model for both simultaneous verification of multiple provers and verification of a single prover with multiple prover devices. Notably, security in the multi-prover setting is governed not by the certified randomness of the joint provers' outputs, but by certified blind local randomness that depends critically on the spatial arrangement of provers and verifiers.
ER  -