Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Entropy

An Efficient Quantum Secret Sharing Scheme Based on Restricted Threshold Access Structure

Lei Li, Zhi Zhou Li

Published Jan 31, 2023• 12 citations
Publisher

Abstract

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.

DOI
10.3390/e25020265

Related papers

Multi-Party Quantum Secret Sharing Based on GHZ State

Zhihui Li, Xue Jiang, Lu Liu

In this paper, we propose an efficient multi-party quantum secret sharing scheme based on GHZ entangled state. The participants in this scheme are divided into two groups, and share secrets as a group. There is no need to exchange any measurement information between the two groups, reducing the security problems caused by the communication process. Each participant holds one particle from each GHZ state; it can be found that the particles of each GHZ state are related after measuring them, and the eavesdropping detection can detect external attacks based on this characteristic. Furthermore, since the participants within the two groups encode the measured particles, they can recover the same secrets. Security analysis shows that the protocol can resist the intercept-and-resend attack and entanglement measurement attack, and the simulation results show that the probability of an external attacker being detected is proportional to the amount of information he can obtain. Compared with the existing protocols, this proposed protocol is more secure, has less quantum resources and is more practical.

Entropy•Oct 8, 2022•8 citations

A (t, n) threshold protocol of semi-quantum secret sharing based on single particles

Ziyi Zhou, Yifei Wang, Zhao Dou +3 more

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%.

Frontiers in Physics•Jul 21, 2023•9 citations

A dual-threshold verifiable multi-party quantum secret sharing scheme based on d-dimensional GHZ state

Dongqin Wen, Dianjun Lu, Gao Qin

Abstract Based on the d-dimensional Greenberger–Horne–Zeilinger (GHZ) state, this paper proposes a novel multi-party quantum secret sharing scheme with the characteristics of identity authentication and dual-threshold. In the scheme, the dealer first constructs an asymmetric binary polynomial and decomposes it into two unary polynomials, then divides the participants into two groups, and generates secret shares and corresponding polynomial pairs for each participant. The dealer prepares a three-qudit GHZ state and uses two of them to perform dual-line transmission between the two groups of participants. The participants perform specific unitary transformations on the transmitted particles. Finally, the recovery agent collects and measures the information particles to recover the secret. The scheme uses a hash function and a session key to detect fraudulent behavior and identify specific participants to achieve identity authentication. Security analysis shows that the scheme can effectively resist intercept-resend attacks, entangle-measure attacks, dishonest participant attacks and Trojan horse attacks.

Laser Physics•Aug 1, 2025•1 citation

A ( t , n )-threshold dynamic quantum secret sharing scheme based on two-particle quantum states

Xi-Heng Ding, 姜东焕 JIANG Dong-huan, Yu-Guang 宇光 Yang 杨 +1 more

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.

Chinese Physics B•Nov 4, 2026•0 citations

Authenticated general hierarchical multi-secret sharing scheme based on high-dimensional quantum system

yuehua Li, Zhaowei Han, Zixin Gao +2 more

Abstract Quantum secret sharing, a pivotal research domain within quantum cryptography, has significant applications across diverse fields such as information security and distributed quantum computing. This paper proposes a d-dimensional hierarchical quantum multi-secret sharing scheme with a general access structure. In the proposed scheme, the distributor constructs a special entangled state by leveraging the secret values at each level and a monotone span program. During the secret reconstruction phase, participants only need to measure the particles in their possession, and authorized participants at each level can recover multiple secrets shared at that level. Additionally, each participant can independently compute and obtain multiple lower-level secrets but cannot access any higher-level secret information. Compared to existing hierarchical quantum secret sharing schemes, the proposed scheme is better suited for specific application scenarios with unique requirements. Furthermore, security analysis demonstrates that the scheme can resist various attacks, such as measurement attacks, intercept-resend attacks, entanglement-measurement attacks, Trojan horse attacks, and collusion attacks.

Physica Scripta•May 2, 2025•5 citations

(t, m) Threshold quantum secret sharing with group authentication

Priyanka Mawlia, Vikash Siwach, Pankaj Bijaranian

Abstract Quantum secret sharing plays a key role as a foundational method for distributing a secret to all participants in quantum cryptography. Group authentication plays a significant role in safeguarding information as it confirms the identity of communication parties. This paper presents a d − level t , m threshold quantum secret-sharing scheme combined with group authentication. Group members can simultaneously authenticate their identities through group authentication. Using the Lagrange interpolation polynomial, the group authentication method disperses multiple secret shares to group members and later allows joint verification of some or all members. The complexities of the developed group authentication scheme are much lower than those found in widely recognized existing group authentication methods. This algorithm allows each participant to keep their secret shares secure and undisclosed. By avoiding transmission of these shares, external eavesdroppers are unable to obtain any secret information. This protocol offers security, efficiency, and practicality. Security analysis reveals its ability to resist intercept-resend attacks, entangle-measure attacks, collusion attacks, and forgery attacks. The proposed scheme ensures both confidentiality and integrity.

Physica Scripta•Jan 14, 2025•7 citations
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.
In this paper, we propose an efficient multi-party quantum secret sharing scheme based on GHZ entangled state. The participants in this scheme are divided into two groups, and share secrets as a group. There is no need to exchange any measurement information between the two groups, reducing the security problems caused by the communication process. Each participant holds one particle from each GHZ state; it can be found that the particles of each GHZ state are related after measuring them, and the eavesdropping detection can detect external attacks based on this characteristic. Furthermore, since the participants within the two groups encode the measured particles, they can recover the same secrets. Security analysis shows that the protocol can resist the intercept-and-resend attack and entanglement measurement attack, and the simulation results show that the probability of an external attacker being detected is proportional to the amount of information he can obtain. Compared with the existing protocols, this proposed protocol is more secure, has less quantum resources and is more practical.
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%.
Abstract Based on the d-dimensional Greenberger–Horne–Zeilinger (GHZ) state, this paper proposes a novel multi-party quantum secret sharing scheme with the characteristics of identity authentication and dual-threshold. In the scheme, the dealer first constructs an asymmetric binary polynomial and decomposes it into two unary polynomials, then divides the participants into two groups, and generates secret shares and corresponding polynomial pairs for each participant. The dealer prepares a three-qudit GHZ state and uses two of them to perform dual-line transmission between the two groups of participants. The participants perform specific unitary transformations on the transmitted particles. Finally, the recovery agent collects and measures the information particles to recover the secret. The scheme uses a hash function and a session key to detect fraudulent behavior and identify specific participants to achieve identity authentication. Security analysis shows that the scheme can effectively resist intercept-resend attacks, entangle-measure attacks, dishonest participant attacks and Trojan horse attacks.
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.
Abstract Quantum secret sharing, a pivotal research domain within quantum cryptography, has significant applications across diverse fields such as information security and distributed quantum computing. This paper proposes a d-dimensional hierarchical quantum multi-secret sharing scheme with a general access structure. In the proposed scheme, the distributor constructs a special entangled state by leveraging the secret values at each level and a monotone span program. During the secret reconstruction phase, participants only need to measure the particles in their possession, and authorized participants at each level can recover multiple secrets shared at that level. Additionally, each participant can independently compute and obtain multiple lower-level secrets but cannot access any higher-level secret information. Compared to existing hierarchical quantum secret sharing schemes, the proposed scheme is better suited for specific application scenarios with unique requirements. Furthermore, security analysis demonstrates that the scheme can resist various attacks, such as measurement attacks, intercept-resend attacks, entanglement-measurement attacks, Trojan horse attacks, and collusion attacks.
Abstract Quantum secret sharing plays a key role as a foundational method for distributing a secret to all participants in quantum cryptography. Group authentication plays a significant role in safeguarding information as it confirms the identity of communication parties. This paper presents a d − level t , m threshold quantum secret-sharing scheme combined with group authentication. Group members can simultaneously authenticate their identities through group authentication. Using the Lagrange interpolation polynomial, the group authentication method disperses multiple secret shares to group members and later allows joint verification of some or all members. The complexities of the developed group authentication scheme are much lower than those found in widely recognized existing group authentication methods. This algorithm allows each participant to keep their secret shares secure and undisclosed. By avoiding transmission of these shares, external eavesdroppers are unable to obtain any secret information. This protocol offers security, efficiency, and practicality. Security analysis reveals its ability to resist intercept-resend attacks, entangle-measure attacks, collusion attacks, and forgery attacks. The proposed scheme ensures both confidentiality and integrity.