Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding

作     者：赖红 罗明星 Josef Pieprzyk 陶丽 刘志明 Mehmet A.Orgun 

作者机构：School of Computer and Information Science Southwest University Information Security and National Computing Grid Laboratory School of Information Science and TechnologySouthwest Jiaotong University School of Electrical Engineering and Computer Science Queensland University of Technology Institute of Computer Science Polish Academy of Sciences Department of Computing Macquarie University Faculty of Information Technology Macao University of Science and Technology 

出 版 物：《Communications in Theoretical Physics》 (理论物理通讯（英文版）)

年 卷 期：2016年第65卷第11期

页      面：501-508页

核心收录：

学科分类：11[军事学] 1105[军事学-军队指挥学] 07[理学] 0839[工学-网络空间安全] 08[工学] 070201[理学-理论物理] 110505[军事学-密码学] 110503[军事学-军事通信学] 0702[理学-物理学] 

基　　金：Supported by the Fundamental Research Funds for the Central Universities under Grant No.XDJK2016C043 the Doctoral Program of Higher Education under Grant No.SWU115091 the National Natural Science Foundation of China under Grant No.61303039 the Fundamental Research Funds for the Central Universities under Grant No.XDJK2015C153 the Doctoral Program of Higher Education under Grant No.SWU114112 the Financial Support the 1000-Plan of Chongqing by Southwest University under Grant No.SWU116007 

主　　题：Fibonacci-and Lucas-valued orbital angular momentum(OAM) states the first kind of Chebyshev maps lower error rates longer destances 

摘      要：In this paper, we develop a large-capacity quantum digital secret sharing(QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum(OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie (Bob ) detected value.