关键词: 量子秘密共享/
图态/
生成矩阵/
组恢复协议
English Abstract
Quantum secret sharing with quantum graph states
Liang Jian-Wu,Cheng Zi,
Shi Jin-Jing,
Guo Ying
1.School of Information Science and Engineering, Central South University, Changsha 410000, China
Fund Project:Project supported by the National Natural Science Foundation of China (Grant Nos. 61379153, 61401519, 61572529), the China Postdoctoral Science Foundation (Grant Nos. 2013M542119, 2014T70772), and the Science and Technology Planning Project of Hunan Province, China (Grant No. 2015RS4032).Received Date:20 April 2016
Accepted Date:17 May 2016
Published Online:05 August 2016
Abstract:Quantum secret sharing is an important way to achieve secure communications, which has critical applications in the field of information security for its physical properties. According to the perspective of the practical applications, improving the confidentiality and integrity of secret sharing schemes is a good method to increase the security and reliability of communications. In this paper, we propose a quantum secret sharing scheme based on generator matrix segmentation and the structural features of quantum graph states. The security of the secure secret sharing scheme is guaranteed by the pattern of transferring information by stabilizers, scalability of the information and new recovery strategy provided by the entanglement of the related graph states. It puts forward an effective solution to the problem of matrix cycle period, where some numbers without the primitive element cannot construct the generation matrix.First of all, the physical properties of quantum bits (qubits), such as uncertainty principle, no-cloning theorem and indistinguishability, not only optimize the classical schemes but also ensure the absolute safety of communication. Secondly, the application of matrix segmentation makes secret information has better scalability. It improves the coding diversity and the difficulty in deciphering. Thirdly, the favorable entanglement properties and mature experiment preparation techniques of graph states provide an approach to the practical applications. The superiority of the yielded graph states is described in graphical fashion with an elegant stabilizer. Fourthly, the shuffling operation can ensure the independence of the message among participants. Therefore, Eve can not obtain any useful information by measuring randomly. Two group-recovery protocols are proposed to show the secret recovering processing through rebuilding sub-secrets among legal cooperative participants.In the scheme design, the dealer extracts the classical secret information according to the corresponding principle between the classical and quantum information, and divides the classical secret through generated matrix which is produced with the primitive elements in finite domain satisfying the linear independence for any k column vectors. Then the dealer encodes information into graph states and distributes particles to the legal participants with unitary operations. Subsequently, the credible center obtains sub-secrets by the theory of graph states and the group recovery protocol. He can achieve the initial classical secret via the inverse algorithm of matrix segmentation. After getting the classical secret, he recovers quantum secret according to the relationship between classical information and quantum information.Theoretical analysis shows that this scheme can provide better security and scalability of the information. It is appropriate to realize the secret sharing in the quantum network communication to protect secrets from eavesdropping. Also, it can provide an approach to designing diverse and scalable quantum secure communication schemes based on quantum graph states, the algorithm of matrix segmentation, and group-recovery protocol.
Keywords: quantum secret sharing/
graph states/
generated matrix/
group-recovery protocol
