Quantum secret sharing via lagrange interpolation: from static to conditional dynamic threshold

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.

Authors

Institutions

Publication Details

Journal
Physica Scripta
Published
2025-06-09
DOI
https://doi.org/10.1088/1402-4896/ade2a5
Citations
2
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum secret sharing via lagrange interpolation: from static to conditional dynamic threshold

Wei-Sheng Lee, Chia‐Wei Tsai, Chi‐Yuan Chen, Kuo-Chun Tseng
2 citations
Physica Scripta
Quantum Information and Cryptography
4.96
article

Quantum secret sharing via lagrange interpolation: from static to conditional dynamic threshold

Wei-Sheng Lee, Chia‐Wei Tsai, Chi‐Yuan Chen, Kuo-Chun Tseng
article en
2 citations

Abstract

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 ScriptaVol. 100(7)
National Taichung University of Science and Technology (TW), National Ilan University (TW), Fo Guang University (TW)
National Science and Technology Council
Openalex Percentile: Top 5%
Quantum Information and Cryptography
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.