One-to-Many Simultaneous Secure Quantum Information Transmission

IF 1.8 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Cryptography Pub Date : 2023-11-05 DOI:10.3390/cryptography7040064
T. Andronikos, A. Sirokofskich
{"title":"One-to-Many Simultaneous Secure Quantum Information Transmission","authors":"T. Andronikos, A. Sirokofskich","doi":"10.3390/cryptography7040064","DOIUrl":null,"url":null,"abstract":"This paper presents a new quantum protocol designed to transmit information from one source to many recipients simultaneously. The proposed protocol, which is based on the phenomenon of entanglement, is completely distributed and is provably information-theoretically secure. Numerous existing quantum protocols guarantee secure information communication between two parties but are not amenable to generalization in situations where the source must transmit information to two or more recipients. Hence, they must be executed sequentially two or more times to achieve the desired goal. The main novelty of the new protocol is its extensibility and generality to situations involving one party that must simultaneously communicate different, in general, messages to an arbitrary number of spatially distributed parties. This is achieved in the special way employed to encode the transmitted information in the entangled state of the system, one of the distinguishing features compared with previous protocols. This protocol can prove expedient whenever an information broker, say, Alice, must communicate distinct secret messages to her agents, all in different geographical locations, in one go. Due to its relative complexity compared with similar cryptographic protocols, as it involves communication among n parties and relies on |GHZn⟩ tuples, we provide an extensive and detailed security analysis so as to prove that it is information-theoretically secure. Finally, in terms of its implementation, the prevalent characteristics of the proposed protocol are its uniformity and simplicity, because it only requires CNOT and Hadamard gates and the local quantum circuits are identical for all information recipients.","PeriodicalId":36072,"journal":{"name":"Cryptography","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2023-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptography","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/cryptography7040064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a new quantum protocol designed to transmit information from one source to many recipients simultaneously. The proposed protocol, which is based on the phenomenon of entanglement, is completely distributed and is provably information-theoretically secure. Numerous existing quantum protocols guarantee secure information communication between two parties but are not amenable to generalization in situations where the source must transmit information to two or more recipients. Hence, they must be executed sequentially two or more times to achieve the desired goal. The main novelty of the new protocol is its extensibility and generality to situations involving one party that must simultaneously communicate different, in general, messages to an arbitrary number of spatially distributed parties. This is achieved in the special way employed to encode the transmitted information in the entangled state of the system, one of the distinguishing features compared with previous protocols. This protocol can prove expedient whenever an information broker, say, Alice, must communicate distinct secret messages to her agents, all in different geographical locations, in one go. Due to its relative complexity compared with similar cryptographic protocols, as it involves communication among n parties and relies on |GHZn⟩ tuples, we provide an extensive and detailed security analysis so as to prove that it is information-theoretically secure. Finally, in terms of its implementation, the prevalent characteristics of the proposed protocol are its uniformity and simplicity, because it only requires CNOT and Hadamard gates and the local quantum circuits are identical for all information recipients.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一对多同时安全量子信息传输
本文提出了一种新的量子协议,旨在将信息从一个信息源同时传输给多个接收者。所提出的协议基于纠缠现象,是完全分布式的,并且在信息论上是安全的。现有的许多量子协议都能保证双方之间的安全信息通信,但在信息源必须向两个或更多接收者传输信息的情况下,这些协议却无法通用。因此,这些协议必须连续执行两次或更多次才能达到预期目标。新协议的主要新颖之处在于它的可扩展性和通用性,适用于一方必须同时向任意数量的空间分布方发送不同的一般信息的情况。这一点是通过在系统纠缠状态中对传输信息进行编码的特殊方式实现的,这也是与以往协议相比的显著特点之一。当信息中介(如爱丽丝)必须一次性向其位于不同地理位置的代理传递不同的秘密信息时,该协议就显得非常有用。与类似的加密协议相比,该协议相对复杂,因为它涉及 n 方之间的通信,并且依赖于 |GHZn⟩ 元组,因此我们提供了广泛而详细的安全性分析,以证明它在信息论上是安全的。最后,在实现方面,拟议协议的主要特点是统一性和简单性,因为它只需要 CNOT 和 Hadamard 门,而且所有信息接收者的本地量子电路都是相同的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Cryptography
Cryptography Mathematics-Applied Mathematics
CiteScore
3.80
自引率
6.20%
发文量
53
审稿时长
11 weeks
期刊最新文献
Natural Language Processing for Hardware Security: Case of Hardware Trojan Detection in FPGAs Entropy Analysis of FPGA Interconnect and Switch Matrices for Physical Unclonable Functions Lattice-Based Post-Quantum Public Key Encryption Scheme Using ElGamal’s Principles Improve Parallel Resistance of Hashcash Tree Public Key Protocols from Twisted-Skew Group Rings
×
引用
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