A Kind of (n,t)Threshold Quantum State Sharing Scheme Based on Chinese Reminder Theorem

Abstract

Secret sharing is a key technology of data confidentiality, where one can distribute a secret among agents, and only the authorized agents can recover the original secret. Quantum information technology, including quantum communication, quantum computing can break through the bottlenecks of classical technology in information security and computing speed, based on quantum mechanics, such as quantum superposition, quantum uncertainty, quantum no-cloning and quantum entanglement. By combining quantum technology with classic secret sharing, the concept of quantum state sharing was presented. In this manuscript, a novel kind of (n,t) threshold quantum state sharing scheme is proposed, where the selected t agents among n agents can cooperate to reconstruct the target secret state. For implementing this scheme, the Chinese reminder theorem is introduced during the processing of the secret key distribution. In addition, to show the proposed scheme clearly, a concrete (5,3) example is given. Furthermore, the proof of the correctness of the scheme is shown. Our scheme will improve the development the quantum secret sharing and open up exploring the application of quantum information technology