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.
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.
Abstract With the rapid development of quantum computing, traditional encryption methods face growing security threats. Quantum Secret Sharing (QSS) has emerged as a promising solution, using quantum principles to improve communication security and prevent internal and external attacks. This study proposes a new (t, n) Threshold Quantum Secret Sharing (TQSS) protocol based on single-qubit unitary operations and Lagrange interpolation. The protocol allows secret reconstruction without third-party or dealer assistance and remains efficient even when some participants are absent. To address more complex real-world scenarios, we extend our previously proposed (t, n) TQSS protocol into a Conditional Dynamic TQSS (CDTQSS). This approach uses resource-based share splitting to allow new participants to join without requiring the dealer to redistribute information. However, the protocol is ‘conditional’ because existing participants must take on extra responsibility-they must assist in generating shares for new members and also participate in the secret reconstruction process together with them. The protocol maintains strong security, reduces resource consumption, and offers better flexibility, making it well-suited for practical and dynamic quantum communication needs.
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.
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.
The dishonest participants have many advantages to gain others’ shares by cheating in quantum secret sharing (QSS) protocols. However, the traditional methods such as identity authentication and message authentication can not resolve this problem due to the reason that the share has already been released to dishonest participants before realizing the deception. In this paper, a continuous variable QSS (CVQSS) scheme is proposed with fairness which ensures all participants can acquire or can not acquire the secret simultaneously. The quantum channel based on two-mode squeezing states provides secure communications through which it can send shares successfully, as long as setting the squeezing and modulation parameters according to the quantum channel transmission efficiency and the Shannon information of shares. In addition, the Chinese Remainder Theorem (CRT) can provides tunable threshold structures according to demands of the complex quantum network and the strategy for fairness can be incorporated with other sharing schemes, resulting in perfect compatibility for practical implementations.
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 (QSS) mitigates critical vulnerabilities in classical cryptographic protocols by leveraging quantum mechanics to achieve information-theoretic security. However, existing QSS schemes encounter challenges related to scalability, resistance to collusive attacks, and the lack of robust participant authentication. This paper proposes a novel ( r , m ) threshold QSS protocol that integrates group authentication with quantum–classical hybrid techniques to address these limitations. By incorporating the Quantum Fourier Transform (QFT), Inverse QFT (IQFT), and controlled-U gate operations within a trivariate polynomial secret-sharing framework, the protocol enhances security against intercept-resend, entangle-measure, and collusive attacks while reducing computational overhead. A practical example is provided to validate the protocol’s effectiveness.