基于k - dwcdm和二次散列的量子密钥分发的永久安全性

Khodakhast Bibak, Robert Ritchie, B. Zolfaghari
{"title":"基于k - dwcdm和二次散列的量子密钥分发的永久安全性","authors":"Khodakhast Bibak, Robert Ritchie, B. Zolfaghari","doi":"10.26421/QIC21.3-4-1","DOIUrl":null,"url":null,"abstract":"Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of ε-almost-∆-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an ε-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"351 1","pages":"181-202"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash\",\"authors\":\"Khodakhast Bibak, Robert Ritchie, B. Zolfaghari\",\"doi\":\"10.26421/QIC21.3-4-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of ε-almost-∆-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an ε-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.\",\"PeriodicalId\":20904,\"journal\":{\"name\":\"Quantum Inf. Comput.\",\"volume\":\"351 1\",\"pages\":\"181-202\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Inf. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26421/QIC21.3-4-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Inf. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26421/QIC21.3-4-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

量子密钥分发(QKD)提供了一种非常强大的特性,称为永久安全性,即如果在执行QKD期间身份验证未被破坏,则生成的密钥在信息理论上无限期地保持安全。为此,我们建议在QKD中使用某些基于通用散列的mac,这些mac快速,对密钥材料非常有效,并且被证明是高度安全的。通用哈希函数在计算机科学中无处不在,从量子密钥分发和信息安全到数据结构和并行计算都有许多应用。在QKD中,它们至少用于身份验证、纠错和隐私放大。使用科恩[杜克数学]的结果。J., 1954],我们也构造了一些新的ε-几乎-∆-全称哈希函数族,它们比众所周知的多项式哈希有更好的碰撞界。然后,我们提出了一种将任意这样的族转换为ε-几乎强通用哈希函数族的一般方法,这使得它们在包括QKD认证在内的广泛应用中非常有用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash
Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of ε-almost-∆-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an ε-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A quantization of interacting particle systems Guidelines to use the ICSM for developing quantum-classical systems A Comparative Analysis of Quantum-based Approaches for Scalable and Efficient Data mining in Cloud Environments On the quantum complexity of integration of a function with unknown singularity Site recurrence for continuous-time open quantum walks on the line
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1