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

Physica ScriptaJun 9, 20253 citations

A communication-efficient quantum threshold secret sharing scheme

Lijie Rui, Zhihui Li, Zhaowei Han +1 more

Quantum Information ProcessingSep 23, 20251 citation

( $t$ , $n$ ) Threshold Quantum Secret Sharing based on a Single $d$ -level Quantum System($t$, $n$) Threshold Quantum Secret Sharing based on a Single $d$-level Quantum System

Changbin Lu, Fuyou Miao, Junpeng Hou

A ( $t$ , $n$ ) threshold quantum secret sharing (QSS) is proposed based on a single $d$ -level quantum system. It enables the ( $t$ , $n$ ) threshold structure based on Shamir's secret sharing and simply requires sequential communication in the $d$ -level quantum system to recover secret. Besides, the scheme employs an additional qudit to detect cheats and eavesdropping during secret reconstruction, and allows a participant to use the share repeatedly. Analyses show that the proposed scheme is resistant to typical attacks. The scheme is scalable in the number of participants and easier to realize compared to related schemes. More generally, our scheme also presents a generic method to construct new ( $t$ , $n$ ) threshold QSS schemes based on $d$ -level quantum system with other classical threshold secret sharing.A ($t$, $n$) threshold quantum secret sharing (QSS) is proposed based on a single $d$-level quantum system. It enables the ($t$, $n$) threshold structure based on Shamir's secret sharing and simply requires sequential communication in the $d$-level quantum system to recover secret. Besides, the scheme employs an additional qudit to detect cheats and eavesdropping during secret reconstruction, and allows a participant to use the share repeatedly. Analyses show that the proposed scheme is resistant to typical attacks. The scheme is scalable in the number of participants and easier to realize compared to related schemes. More generally, our scheme also presents a generic method to construct new ($t$, $n$) threshold QSS schemes based on $d$-level quantum system with other classical threshold secret sharing.

Oct 31, 20170 citations

A Practical and Efficient Quantum Threshold Secret Sharing Scheme

Na Zhou, Zhihui Li, Xingjia Wei +1 more

International Journal of Theoretical PhysicsOct 21, 20250 citations

(

t

n

) Threshold Quantum Secret Sharing based on a Single

d

-level Quantum System

A (

t

n

) threshold quantum secret sharing (QSS) is proposed based on a single

d

-level quantum system. It enables the (

t

n

) threshold structure based on Shamir's secret sharing and simply requires sequential communication in the

d

-level quantum system to recover secret. Besides, the scheme employs an additional qudit to detect cheats and eavesdropping during secret reconstruction, and allows a participant to use the share repeatedly. Analyses show that the proposed scheme is resistant to typical attacks. The scheme is scalable in the number of participants and easier to realize compared to related schemes. More generally, our scheme also presents a generic method to construct new (

t

n

) threshold QSS schemes based on

d

-level quantum system with other classical threshold secret sharing.