从通信复杂性看混合量子密码

IF 5.1 2区 物理与天体物理 Q1 PHYSICS, MULTIDISCIPLINARY
Quantum Pub Date : 2025-09-24 DOI:10.22331/q-2025-09-24-1862
Francesco Mazzoncini, Balthazar Bauer, Peter Brown, Romain Alléaume
{"title":"从通信复杂性看混合量子密码","authors":"Francesco Mazzoncini, Balthazar Bauer, Peter Brown, Romain Alléaume","doi":"10.22331/q-2025-09-24-1862","DOIUrl":null,"url":null,"abstract":"We introduce an explicit construction for a key distribution protocol in the Quantum Computational Timelock (QCT) security model, where one assumes that computationally secure encryption may only be broken after a time much longer than the coherence time of available quantum memories.<br/> Taking advantage of the QCT assumptions, we build a key distribution protocol called HM-QCT from the Hidden Matching problem for which there exists an exponential gap in one-way communication complexity between classical and quantum strategies.<br/> We establish that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem with classical information. Legitimate users, on the other hand, can use quantum communication, which gives them the possibility of sending multiple copies of the same quantum state while retaining an information advantage. This leads to an everlasting secure key distribution scheme over $n$ bosonic modes. Such a level of security is unattainable with purely classical techniques. Remarkably, the scheme remains secure with up to $\\mathcal{O}\\big( \\frac{\\sqrt{n}}{\\log(n)}\\big)$ input photons for each channel use, extending the functionalities and potentially outperforming QKD rates by several orders of magnitudes.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"10 1","pages":""},"PeriodicalIF":5.1000,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hybrid Quantum Cryptography from Communication Complexity\",\"authors\":\"Francesco Mazzoncini, Balthazar Bauer, Peter Brown, Romain Alléaume\",\"doi\":\"10.22331/q-2025-09-24-1862\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce an explicit construction for a key distribution protocol in the Quantum Computational Timelock (QCT) security model, where one assumes that computationally secure encryption may only be broken after a time much longer than the coherence time of available quantum memories.<br/> Taking advantage of the QCT assumptions, we build a key distribution protocol called HM-QCT from the Hidden Matching problem for which there exists an exponential gap in one-way communication complexity between classical and quantum strategies.<br/> We establish that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem with classical information. Legitimate users, on the other hand, can use quantum communication, which gives them the possibility of sending multiple copies of the same quantum state while retaining an information advantage. This leads to an everlasting secure key distribution scheme over $n$ bosonic modes. Such a level of security is unattainable with purely classical techniques. Remarkably, the scheme remains secure with up to $\\\\mathcal{O}\\\\big( \\\\frac{\\\\sqrt{n}}{\\\\log(n)}\\\\big)$ input photons for each channel use, extending the functionalities and potentially outperforming QKD rates by several orders of magnitudes.\",\"PeriodicalId\":20807,\"journal\":{\"name\":\"Quantum\",\"volume\":\"10 1\",\"pages\":\"\"},\"PeriodicalIF\":5.1000,\"publicationDate\":\"2025-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.22331/q-2025-09-24-1862\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.22331/q-2025-09-24-1862","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

我们在量子计算时间锁(QCT)安全模型中引入了一个密钥分发协议的显式结构,其中假设计算安全加密只有在比可用量子存储器的相干时间长得多的时间后才可能被打破。利用QCT假设,我们从经典策略和量子策略之间单向通信复杂度存在指数差距的隐藏匹配问题出发,构建了一个密钥分发协议HM-QCT。我们建立了HM-QCT对任意id攻击的安全性可以降低到解决底层与经典信息的隐藏匹配问题的难度。另一方面,合法用户可以使用量子通信,这使他们有可能发送相同量子态的多个副本,同时保留信息优势。这导致了在$n$玻色子模式上的永久安全密钥分发方案。这种级别的安全性是纯经典技术无法实现的。值得注意的是,该方案在每个通道使用高达$\mathcal{O}\big( \frac{\sqrt{n}}{\log(n)}\big)$输入光子的情况下保持安全,扩展了功能,并可能比QKD速率高出几个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybrid Quantum Cryptography from Communication Complexity
We introduce an explicit construction for a key distribution protocol in the Quantum Computational Timelock (QCT) security model, where one assumes that computationally secure encryption may only be broken after a time much longer than the coherence time of available quantum memories.
Taking advantage of the QCT assumptions, we build a key distribution protocol called HM-QCT from the Hidden Matching problem for which there exists an exponential gap in one-way communication complexity between classical and quantum strategies.
We establish that the security of HM-QCT against arbitrary i.i.d. attacks can be reduced to the difficulty of solving the underlying Hidden Matching problem with classical information. Legitimate users, on the other hand, can use quantum communication, which gives them the possibility of sending multiple copies of the same quantum state while retaining an information advantage. This leads to an everlasting secure key distribution scheme over $n$ bosonic modes. Such a level of security is unattainable with purely classical techniques. Remarkably, the scheme remains secure with up to $\mathcal{O}\big( \frac{\sqrt{n}}{\log(n)}\big)$ input photons for each channel use, extending the functionalities and potentially outperforming QKD rates by several orders of magnitudes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Quantum
Quantum Physics and Astronomy-Physics and Astronomy (miscellaneous)
CiteScore
9.20
自引率
10.90%
发文量
241
审稿时长
16 weeks
期刊介绍: Quantum is an open-access peer-reviewed journal for quantum science and related fields. Quantum is non-profit and community-run: an effort by researchers and for researchers to make science more open and publishing more transparent and efficient.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信