Abstract Quantum secret sharing plays a crucial role in quantum cryptography. In this paper, an efficient and novel weighted threshold quantum secret sharing scheme with changeable participant weights is firstly proposed based on the monotone span program(MSP) and linear secret sharing(LSS) scheme. First, in the secret reconstruction phase, participants only need to perform simple measurement operations on the particles to successfully recover and verify the secret. Additionally, throughout the entire scheme, participants are not required to perform any quantum operations, significantly enhancing the efficiency of the scheme. Secondly, without altering the secret shares of all participants, our scheme firstly enables dynamic changes in participant weights without the need for re-execution, which improves the practicality of the scheme. Security analysis shows that our scheme is resistant to a series of typical attacks. Compared with the existing schemes, our scheme is more efficient and practical.
Abstract Quantum secret sharing plays a crucial role in quantum cryptography. In this paper, an efficient and novel weighted threshold quantum secret sharing scheme with changeable participant weights is firstly proposed based on the monotone span program(MSP) and linear secret sharing(LSS) scheme. First, in the secret reconstruction phase, participants only need to perform simple measurement operations on the particles to successfully recover and verify the secret. Additionally, throughout the entire scheme, participants are not required to perform any quantum operations, significantly enhancing the efficiency of the scheme. Secondly, without altering the secret shares of all participants, our scheme firstly enables dynamic changes in participant weights without the need for re-execution, which improves the practicality of the scheme. Security analysis shows that our scheme is resistant to a series of typical attacks. Compared with the existing schemes, our scheme is more efficient and practical.
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.
Quantum secret sharing holds a significant place in quantum cryptography. In this paper, a (w, t, n)-weighted threshold dynamic quantum secret sharing scheme with cheating identification is constructed based on the CRT for a polynomial ring. In our scheme, on the premise of not altering the private shares of the old participants, the dynamic update of the participants can be realized without other participants’ help, and the shared secret will not be changed. During the secret reconstruction phase, via executing the quantum state digital signature, the proposed scheme not only can timely detect the existence of the cheating behavior, but also once exists, definitely can identify one cheater and eliminate him from the system, making the scheme more secure. Moreover, our scheme enables secret sharing among participants with different authorities, which enhances the practicability of the scheme. Finally, the security analysis shows our scheme not only is resistant to a range of typical external attacks but can detect forgery, collusion, denial and dishonest revoked participant attacks.
Quantum secret sharing plays a crucial role in quantum cryptography. The two main trends in quantum secret sharing are to address the problem of scheme failure due to participant spoofing and to improve the efficiency of quantum secret sharing. This paper focuses on the quantum secret sharing scheme with general access structure due to its flexibility. We design a special entangled state by resorting to Monotone Span Program (MSP). Based on the special 2-dimensional entangled state, an efficient and verifiable general quantum secret sharing (GQSS) scheme is proposed. In the GQSS scheme, the authorized participants only provide the X-basis measurement results of particles to recover and verify the shared secret, which makes that our scheme have lower communication consumption and quantum computational complexity. The analysis shows that the proposed scheme is simpler and more practical compared with related quantum secret sharing schemes.
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.
Secret sharing is a widely-used security protocol and cryptographic primitive in which all people cooperate to restore encrypted information. The characteristics of a quantum field guarantee the security of information; therefore, many researchers are interested in quantum cryptography and quantum secret sharing (QSS) is an important research topic. However, most traditional QSS methods are complex and difficult to implement. In addition, most traditional QSS schemes share classical information, not quantum information which makes them inefficient to transfer and share information. In a weighted threshold QSS method, each participant has each own weight, but assigning weights usually costs multiple quantum states. Quantum state consumption will therefore increase with the weight. It is inefficient and difficult, and therefore not able to successfully build a suitable agreement. The proposed method is the first attempt to build multiparty weighted threshold QSS method using single quantum particles combine with the Chinese remainder theorem (CRT) and phase shift operation. The proposed scheme allows each participant has its own weight and the dealer can encode a quantum state with the phase shift operation. The dividing and recovery characteristics of CRT offer a simple approach to distribute partial keys. The reversibility of phase shift operation can encode and decode the secret. The proposed weighted threshold QSS scheme presents the security analysis of external attacks and internal attacks. Furthermore, the efficiency analysis shows that our method is more efficient, flexible, and simpler to implement than traditional methods.
Abstract Quantum secret sharing (QSS) plays a crucial role in quantum cryptography as a privacy preserving scheme. Designing an efficient QSS protocol requires addressing three key challenges: 1) dynamic agent membership (handling agents joining or leaving during execution), 2) adversarial resilience (ensuring robustness against dishonest agents), and 3) practical optimization (improving computational and communication efficiency while minimizing implementation cost). In this paper, a verifiable dynamic threshold QSS (VDQSS) protocol with authentication capability is proposed. The protocol employs single particles for both authentication and share distribution, combining homogeneous linear recursion (HLR) with mutually unbiased bases (MUBs) to reconstruct multiple secrets. This approach significantly enhances security while reducing protocol complexity. The correctness and practicality of the protocol are validated through experimental simulations. Analytical results demonstrate its robustness against common attacks, providing reliable security guarantees for quantum communications. Compared to existing QSS protocols, the protocol offers enhanced simplicity and practical applicability.