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%.
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%.
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.
Abstract Quantum secret sharing is an important branch of quantum cryptography. In this paper, we propose a ( t , n )-threshold dynamic quantum secret sharing scheme based on two-particle quantum states. By combining Shamir’s polynomial structure with sequential quantum operations, any t authorized participants can jointly reconstruct the shared secret, while fewer than t participants cannot obtain useful information. In the recovery phase, the weighted shares of the authorized participants are successively encoded into a transmitted two-particle quantum state, and random numbers are introduced to protect the intermediate quantum information. Moreover, the proposed scheme supports participant addition and deletion without changing the original secret. A new participant can obtain a valid share with the cooperation of an authorized subset, whereas the old shares of deleted participants are invalidated by refreshing the sharing polynomial. The correctness analysis shows that the secret can be accurately recovered by an authorized subset. The security analysis addresses selected attacks under the stated assumptions, but does not establish integrity protection against active state modification. Therefore, the proposed scheme achieves flexible threshold reconstruction and dynamic participant management based on two-particle quantum states.
Semi-quantum secret sharing (SQSS) is a branch of quantum cryptography which only requires the dealer to have quantum capabilities, reducing the difficulty of protocol implementation. However, the efficiency of the SQSS protocol still needs to be further studied. In this paper, we propose a semi-quantum secret sharing protocol, whose efficiency can approach 100% as the length of message increases. The protocol is based on single particles to reduce the difficulty of resource preparation. Particle reordering, a simple but effective operation, is used in the protocol to improve efficiency and ensure security. Furthermore, our protocol can share specific secrets while most SQSS protocols could not. We also prove that the protocol is secure against common attacks.
Quantum secret sharing is an important branch of quantum cryptography, and secure multi-party quantum key distribution protocols can be constructed using quantum secret sharing. In this paper, we construct a quantum secret sharing scheme built on a constrained (t, n ) threshold access structure, where n is the number of participants and t is the threshold number of participants and the distributor. Participants from two different sets perform the corresponding phase shift operations on two particles in the GHZ state passed to them, and then t−1 participants with the distributor can recover the key, where the participant recovering the key measures the particles received by himself and finally obtains the key through the collaboration of the distributors. Security analysis shows that this protocol can be resistant to direct measurement attacks, interception retransmission attacks, and entanglement measurement attacks. This protocol is more secure, flexible, and efficient compared with similar existing protocols, which can save more quantum resources.
Abstract Semi-quantum secret sharing (SQSS) is an important branch of semi-quantum cryptography, and differs from quantum secret sharing (QSS) in that not all parties are required to possess quantum capabilities. All previous SQSS protocols have three common features: (i) they adopt product states or entangled states as initial quantum resource; (ii) the particles prepared by quantum party are transmitted in a tree-type way; and (iii) they require the classical parties to possess the measurement capability. In this paper, two circular SQSS protocols with single particles are suggested, where the first one requires the classical parties to possess the measurement capability while the second one does not have this requirement. Compared with the previous SQSS protocols, the proposed SQSS protocols have some distinct features: (i) they adopt single particles rather than product states or entangled states as initial quantum resource; (ii) the particles prepared by quantum party are transmitted in a circular way; and (iii) the second protocol releases the classical parties from the measurement capability. The proposed SQSS protocols are robust against some famous attacks from an eavesdropper, such as the measure-resend attack, the intercept-resend attack and the entangle-measure attack, and are feasible with present quantum technologies in reality .
Seldom quantum secret sharing protocols with both the flexible (t, n) threshold and semi-quantum properties have been proposed. Recently, a novel idea of (t, n) threshold semiquantum secret sharing was proposed, which has both the (t, [Formula: see text] threshold and semi-quantum properties. Its idea can simplify the quantum secret sharing process such that many classical users with simple ability of quantum operations can realize the communication goal by cooperating with one quantum party. Furthermore, the protocol is very flexible since any t collaborators of the n classical users can reconstruct the full secret by Shamir’s threshold technology. Unfortunately, their protocol is vulnerable to the NOT-gate attack. This paper shows that an attacker can break the (t, n) threshold protocol by performing two rounds of NOT-gate attack. Then, an improved (t, n) threshold semiquantum secret sharing protocol is proposed. In the improvement scheme, each receiver can perform the eavesdropping check by measuring the Z-basis sample states. The improved protocol not only has semi-quantum properties but also can repair the security hole of the old version and has enhanced security against various quantum attacks.