An efficient [Formula: see text] threshold quantum secret sharing (QSS) scheme is proposed. In our scheme, the Hash function is used to check the eavesdropping, and no particles need to be published. So the utilization efficiency of the particles is real 100%. No entanglement is used in our scheme. The dealer uses the single particles to encode the secret information, and the participants get the secret through measuring the single particles. Compared to the existing schemes, our scheme is simpler and more efficient.
An efficient [Formula: see text] threshold quantum secret sharing (QSS) scheme is proposed. In our scheme, the Hash function is used to check the eavesdropping, and no particles need to be published. So the utilization efficiency of the particles is real 100%. No entanglement is used in our scheme. The dealer uses the single particles to encode the secret information, and the participants get the secret through measuring the single particles. Compared to the existing schemes, our scheme is simpler and more efficient.
Most (k, n) threshold quantum secret sharing protocols are fully quantum. The message receivers must be equipped with complex quantum devices so as to prepare various quantum resources and perform complex quantum operations, which may affect the practice of these protocols. On the other hand, the qubit efficiency of most (k, n) threshold quantum secret sharing protocols is not more than 1/2. To simplify the (k, n) threshold quantum secret sharing protocol and improve its practice and qubit efficiency, a new (k, n) threshold secret sharing protocol with semi-quantum properties is proposed. In this protocol, the dealer prepares decoy particles and sends them to the receivers. The receivers insert particles carrying secret information along with Z-basis decoy particles into the received particle sequence to generate mixed-particle sequences, which are returned to the dealer. The dealer measures the received particle sequences to check for eavesdropping and establishes shared secret keys with the receivers. With the shared secret keys, the dealer distributes the secret pieces among the receivers using Shamir’s secret sharing scheme. Multiple secret messages can be recovered by k or more receivers. The qubit efficiency of our protocol is k/n. For an (n, n) threshold protocol, the qubit efficiency would be 100%. The proposed scheme is based on single particles without using any entangled system. Therefore, its quantum resources are relatively easy to prepare. Receivers must only prepare simple Z-basis qubits. Its semi-quantum properties enhance practice implementation. The proposed protocol has robust security against various types of attacks, including eavesdropping, internal, and collusion attacks. Furthermore, it can resist the unitary attack, which is seldom analyzed in other protocols.
An efficient multiparty quantum secret sharing scheme is proposed, in which the secret is a quantum state, and the dealer encodes the secret by performing the operations of quantum-controlled-not and Hadamard gate. The participants perform the single-particle measurements on their particles, and then can cooperate to recover the original quantum state. In our scheme, both the dealer and the participants do not need to perform the entanglement measurement. Compared with the existing schemes, our scheme is simpler and more efficient.
Abstract Quantum secret sharing (QSS) can address the increasing threat of computing power. While semi-QSS protocols alleviate participants’ reliance on quantum devices, ensuring security and lowering the participation difficulty. In this paper, we propose a semi-QSS protocol based on four quantum entangled states within a four-dimensional quantum system. It generates a four-dimensional four-quantum entangled state through a dealer, requiring full quantum capability for the dealer and only partial quantum capability for the participants. Participants perform random operations on the received qubits, and eavesdropping detection is based on these random operations. Then the dealer can choose the correct measurement basis based on the receiver’s specific operations. The security and quantum efficiency of protocol depend on the ratio of information to decoy particles inserted by the dealer. Furthermore, the security analysis shows that the protocol is resistant to common quantum attacks.
Abstract Threshold quantum secret sharing is a cryptography technique for dividing and reconstructing secret information. The dealer shares a secret based on quantum mechanics principles, and a subset of participants cooperate to recover that secret. For example, in k , n quantum threshold scheme and n , n quantum threshold scheme, the former can only reconstruct the secret when at least k shares are collected. The latter requires all n shares to be collected to reconstruct the secret. However, in real scenarios, the priority of participant identities may vary. In order to meet the actual needs of participants with different rights, this paper proposes a w , ω , n quantum secret sharing (QSS) scheme. When the sum of participants’ weights w is greater than or equal to a threshold ω, they can cooperate to reconstruct the secret. In order to achieve this, this paper uses the entangled state of single particles and constructs a verifiable QSS scheme based on the Chinese remainder theorem. Significantly, in case of a dishonest participant, the dealer can delete the participant before recovering the secret to ensure the security of the communication. This scheme is more flexible than other threshold protocols. At the same time, it reduces the communication cost of the participants. In addition, security analysis shows that the scheme resists typical external and internal attacks.
(t, n) Threshold Quantum Secret Sharing based on a Single d-level Quantum System
A (t, n) threshold quantum secret sharing (QSS) is proposed based on a single d-level quantum system. It enables the (t, n) threshold structure based on Shamir's secret sharing and simply requires sequential communication in the d-level quantum system to recover secret. Besides, the scheme employs an additional qudit to detect cheats and eavesdropping during secret reconstruction, and allows a participant to use the share repeatedly. Analyses show that the proposed scheme is resistant to typical attacks. The scheme is scalable in the number of participants and easier to realize compared to related schemes. More generally, our scheme also presents a generic method to construct new (t, n) threshold QSS schemes based on d-level quantum system with other classical threshold secret sharing.
Semi-quantum secret sharing is an important research issue in quantum cryptography. In this paper, we propose a (t, n) threshold semi-quantum secret sharing protocol, which combines the practicality of semi-quantum secret sharing protocols and the flexibility of (t, n) threshold quantum secret sharing protocols. Participants prepare and transmit single particles in a circular way, and then any t out of n participants can recover the secret according to Shamir’s secret sharing scheme. As quantum resources, single particles are easy to prepare. Furthermore, classical participants only need to possess the capability to prepare and insert particles. The security analysis shows our protocol has security against most attacks. Except decoy particles, all particles are useful to carry the secret message, so the efficiency of the proposed protocol can achieve 100%.