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 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 occupies an important position in quantum cryptography. In this document, a dynamic (t, n) threshold quantum secret sharing scheme is proposed based on homogeneous LFSR sequences and d-dimensional Bell states. The secret shared among agents in this scheme is determined by the distributor and the scheme enables the update of agents without the help of other agents. More, this paper considers the case when no less than t agents cooperate in secret reconstruction, which makes the proposed scheme more flexible and practical than the existing ones. Finally, our scheme is not only resistant to eavesdropping, collusion, dishonest revoked agent, and in-attacker’s cheating attacks, but also agents can verify for themselves that the shared secrets are correct.
Abstract Threshold quantum secret sharing is a typical method for quantum secret sharing (QSS) schemes. In this paper, we propose a verifiable t , n threshold QSS scheme based on the d -dimensional Bell state and asymmetric binary polynomial. In this scheme, the dealer encodes the secret using the asymmetric binary polynomial and generates the corresponding secret share for each participant. Then, the dealer prepares the d -dimensional Bell state, and the participants perform corresponding unitary operations on the particles in transmission to recover the secret. With the hash function and the session key pairs, not only the cheating behavior of the dishonest participants can be detected, but also the specific cheaters can be identified. Furthermore, we consider the case when no less than t participants cooperate to recover the secret, which makes the proposed scheme more practical. Analyses show that the scheme can resist forgery attack, collusion attack and other common 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.
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 occupies an important position in quantum cryptography. In this paper, we propose two ( w , ω , n ) weighted threshold quantum secret sharing schemes on d-level single quantum systems that share classical information and quantum states, respectively. The dealer Alice distributes the secret share to each participant using the Chinese Remainder Theorem(CRT) for a polynomial ring, which can realize secret sharing among participants with different weights. In classical information sharing, the dealer can share multiple secrets in one round of the protocol and the participants can verify the correctness of the recovered secrets. In quantum state sharing, the dealer can share multiple single quantum states in one round of protocol. Finally, we demonstrate that our scheme is resistant to common external and internal attacks and compare it with related schemes.
Abstract Existing end-to-end communication schemes often rely on single-path or backup multi-path transmission. However, under quantum threats and dynamic network environments, such approaches are susceptible to path failures and attacks, resulting in insufficient system robustness and security. To address these issues, this paper proposes a novel WVTRC-QSS method. Based on QSS, this method introduces a polynomial ring-based CRT to replace the traditional Lagrangian interpolation, thereby reducing the computational complexity of secret share generation and distribution while ensuring the ideal information rate. To further adapt this method, this paper designs the WCOPS algorithm, which transforms the participation model from multi-node to multi-path, where multi-path is only used for the transmission of secret shares, not their storage, significantly improving transmission security and efficiency. Furthermore, by introducing a nested closed interval mechanism, this scheme supports dynamic threshold adjustment without redistributing shares, thereby enhancing the system’s adaptability to network threats and path failures. Theoretical analysis and numerical simulations show that WVTRC-QSS outperforms the traditional QSS scheme based on Lagrangian interpolation in terms of resistance to node failure, resistance to collusion attacks, QBER tolerance, and secret reconstruction efficiency.It provides strong technical support for secure and efficient transmission of sensitive data in next-generation networks and is suitable for complex and changing network environments.