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

Quantum Information Processing

A new and efficient fair quantum secret sharing scheme

Jiayu Gu, Fulin Li, Shixin Zhu

Published Nov 24, 2025• 1 citation
Publisher
DOI
10.1007/s11128-025-05006-y

Related papers

A (t, n) Threshold Quantum Secret Sharing Scheme with Fairness

Fulin Li, Tingyan Chen, Shixin Zhu

International Journal of Theoretical Physics•Jun 3, 2023•12 citations

A New Improving Quantum Secret Sharing Scheme

Ting-Ting Xu, Zhihui Li, Chen‐Ming Bai +1 more

International Journal of Theoretical Physics•Jan 28, 2017•15 citations

Continuous Variable Quantum Secret Sharing with Fairness

Ye Eun Kang, Ying Guo, Hai Zhong +2 more

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.

Applied Sciences•Dec 25, 2019•5 citations

A new quantum secret sharing scheme

Xu Shengwei

Journal of Shandong University•Jan 1, 2016•0 citations

Concatenating Extended CSS Codes for Communication Efficient Quantum Secret Sharing

Kaushik Senthoor, Pradeep Kiran Sarvepalli

Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the quantum communication cost during secret recovery in quantum threshold secret sharing schemes. However, non-threshold schemes are known to have less storage cost compared to threshold schemes. This motivates us to extend the idea of communication efficiency to non-threshold schemes as well. In this paper, we introduce a general class of communication efficient quantum secret sharing schemes (CE-QSS) which include both threshold and non-threshold schemes. Specifically, we provide a framework for constructing CE-QSS schemes by concatenating a pair of CSS codes. The main component in this framework is a new class of Calderbank-Shor-Steane (CSS) codes called the extended CSS codes.

arXiv:2211.06910•International Symposium on Turbo Codes and Iterative Information Processing•Sep 4, 2023•4 citations

A Practical and Efficient Quantum Threshold Secret Sharing Scheme

Na Zhou, Zhihui Li, Xingjia Wei +1 more

International Journal of Theoretical Physics•Oct 21, 2025•0 citations
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.
Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the quantum communication cost during secret recovery in quantum threshold secret sharing schemes. However, non-threshold schemes are known to have less storage cost compared to threshold schemes. This motivates us to extend the idea of communication efficiency to non-threshold schemes as well. In this paper, we introduce a general class of communication efficient quantum secret sharing schemes (CE-QSS) which include both threshold and non-threshold schemes. Specifically, we provide a framework for constructing CE-QSS schemes by concatenating a pair of CSS codes. The main component in this framework is a new class of Calderbank-Shor-Steane (CSS) codes called the extended CSS codes.