arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2609.23234quant-ph

面向城域网的容损量子位置验证

Loss-Tolerant Quantum Position Verification for Metropolitan Area Networks

  • Qunnect Inc.(Qunnect公司)

机构由 AI 辅助整理,请以论文原文为准。

Wen Yu Kon, Niccolò Bigagli, Andrew Conrad, Taylor Shields, Fatih Kaleoglu, Ignatius William Primaatmaja, Alexander Craddock, RJ Pisani, Mael Flament, Jude Seeb… 展开作者

Wen Yu Kon, Niccolò Bigagli, Andrew Conrad, Taylor Shields, Fatih Kaleoglu, Ignatius William Primaatmaja, Alexander Craddock, RJ Pisani, Mael Flament, Jude Seeber, Omar Amer, Charles Lim, Xinhua Ling, Rob Otter, Kaushik Chakraborty, Mehdi Namazi

中文总结 AI 辅助

本文提出并实验验证了一种信道损耗无关的量子位置验证协议,利用商用组件在城域尺度实现安全位置认证,并证明了针对量子对手的有限尺寸安全性。

中文摘要 AI 辅助

时空封印是一种密码学保证,即数字事件已在经批准的地点和时间发生,它可以通过位置认证增强数字签名,用于法律、金融和监管用例。在对抗性环境中,这种封印的任何纯经典实现都可能被伪造。量子位置验证(QPV)提供了一种基于物理学的解决方案,利用不可克隆定理和不可信号原理来证明一方的时空坐标。虽然最近已通过纠缠和相干光协议展示了QPV的可行性,但在城域尺度上实现这些方案的容损性会大幅增加实现复杂度。在此,我们提出并实验演示了一种容损QPV(LT-QPV)协议,其安全性独立于信道损耗。我们在以密码学安全哈希函数实例化的量子随机预言机模型中,证明了针对量子多项式时间纠缠对手的有限尺寸安全性。我们的系统完全使用商用现成组件实现,在22分钟净数据收集时间内,能针对受限对手认证位置,并有一条通过升级硬件实现实时认证(<1秒)的清晰路径。我们的架构仅需一个量子验证节点及经典基础设施,自然兼容城域量子网络,为可部署的、基于物理学的可扩展时空认证服务奠定了基础。

英文摘要

A spacetime seal, a cryptographic guarantee that a digital event has occurred at an approved location and time, can augment a digital signature with location attestation for legal, financial, and regulatory use cases. In adversarial settings any purely classical realization of such a seal can be spoofed. Quantum position verification (QPV) offers a physics-based solution, exploiting the no-cloning theorem and the no-signaling principle to certify a party's spacetime coordinates. While the feasibility of QPV has been recently shown via entanglement- and coherent light-based protocols, achieving loss tolerance for these schemes substantially increases implementation complexity at metropolitan scales. Here, we introduce and experimentally demonstrate a loss-tolerant QPV (LT-QPV) protocol whose security is independent of channel loss. We prove finite-size security against quantum polynomial-time entangled adversaries in the quantum random oracle model instantiated with cryptographically secure hash functions. Implemented entirely with commercial off-the-shelf components, our system certifies position within 22 minutes of net data collection time against a restricted adversary, with a clear path to real-time certification (<1s) with upgraded hardware. Our architecture, requiring only a single quantum verifier node alongside classical infrastructure, is naturally compatible with metropolitan-area quantum networks, establishing the foundations for scalable, physics-backed spacetime certification as a deployable service.

↑