Certified Randomness implies Secure Classical Position-Verification
<|reference_start|>Certified Randomness implies Secure Classical Position-Verification: Liu et al. (ITCS22) initiated the study of designing a secure position verification protocol based on a specific proof of quantumness protocol and classical communication. In this paper, we study this interesting topic further and answer some of the open questions that are left in that paper. We provide a new generic compiler that can convert any single round proof of quantumness-based certified randomness protocol to a secure classical communication-based position verification scheme. Later, we extend our compiler to different kinds of multi-round proof of quantumness-based certified randomness protocols. Moreover, we instantiate our compiler with a random circuit sampling (RCS)-based certified randomness protocol proposed by Aaronson and Hung (STOC 23). RCS-based techniques are within reach of today's NISQ devices; therefore, our design overcomes the limitation of the Liu et al. protocol that would require a fault-tolerant quantum computer to realize. Moreover, this is one of the first cryptographic applications of RCS-based techniques other than certified randomness.<|reference_end|>
@article{amer2024certified,
    title={Certified Randomness implies Secure Classical Position-Verification},
    author={Omar Amer, Kaushik Chakraborty, David Cui, Fatih Kaleoglu, Charles
  Lim, Minzhao Liu, and Marco Pistoia},
    journal={arXiv preprint arXiv:2410.03982},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.03982},
    primaryClass={quant-ph cs.CR}
}