One-to-Many Simultaneous Secure Quantum Information Transmission

被引:4
|
作者
Andronikos, Theodore [1 ]
Sirokofskich, Alla [2 ]
机构
[1] Ionian Univ, Dept Informat, 7 Tsirigoti Sq, Corfu 49100, Greece
[2] Natl & Kapodistrian Univ Athens, Dept Hist & Philosophy Sci, Athens 15771, Greece
关键词
quantum cryptography; quantum entanglement; quantum protocols; GHZ states; information-theoretically secure; quantum games; CRYPTOGRAPHY;
D O I
10.3390/cryptography7040064
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 & rang; 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.
引用
收藏
页数:20
相关论文
共 50 条
  • [31] One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information
    Salek, Farzin
    Anshu, Anurag
    Hsieh, Min-Hsiu
    Jain, Rahul
    Fonollosa, Javier Rodriguez
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (04) : 2141 - 2164
  • [32] The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
    Bresler, Guy
    Parekh, Abhay
    Tse, David N. C.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) : 4566 - 4592
  • [33] On the Sum Capacity of Many-to-one and One-to-many Gaussian Interference Channels
    Gnanasambandam, Abhiram
    Chaluvadi, Ragini
    Bhashyam, Srikrishna
    2017 FIFTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2017, : 1842 - 1846
  • [34] One-to-many business service negotiation model
    Zhang, Jian-Liang
    Fan, Yu-Shun
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2012, 18 (10): : 2323 - 2330
  • [35] Coevolutionary dynamics in one-to-many mutualistic systems
    Ezoe, Hideo
    THEORETICAL ECOLOGY, 2016, 9 (04) : 381 - 388
  • [36] Constraints in One-to-Many Concretization for Abstraction Refinement
    Nanshi, Kuntal
    Somenzi, Fabio
    DAC: 2009 46TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2009, : 569 - 574
  • [37] On Handling One-to-Many Transformations in Relational Systems
    Carreira, Paulo
    Galhardas, Helena
    Pereira, Joao D.
    Wichert, Andrzej
    ENTERPRISE INFORMATION SYSTEMS-BOOKS, 2008, 12 : 121 - +
  • [38] One-to-many face recognition with bilinear CNNs
    RoyChowdhury, Aruni
    Lin, Tsung-Yu
    Maji, Subhransu
    Learned-Miller, Erik
    2016 IEEE WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION (WACV 2016), 2016,
  • [39] Improvements of the One-to-Many Eigenvoice Conversion System
    Ohtani, Yamato
    Toda, Tomoki
    Saruwatari, Hiroshi
    Shikano, Kiyohiro
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (09): : 2491 - 2499
  • [40] Visual analysis of one-to-many matched graphs
    di Giacomo E.
    Didimo W.
    Liotta G.
    Palladino P.
    Journal of Graph Algorithms and Applications, 2010, 14 (01): : 97 - 119