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.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 SciencesDec 25, 20195 citations

Augmented ((t,n))-threshold Quantum Secret Sharing Schemes

Steven Chien

Oct 2, 20200 citations

Cryptanalysis and improvement of fair quantum secret sharing based on symmetric bivariate polynomial

Jiebin Gu, Feixiang Li, Shixin Zhu

Abstract As a fundamental component of quantum cryptography, quantum secret sharing (SS) faces a critical security challenge: dishonest participants may gain exclusive access to the shared secret through deceptive actions. To address this, recent advances in fair quantum SS have emerged, allowing equitable secret access among all participants. However, our analysis reveals security vulnerabilities in Bai et al ’s fair quantum SS scheme (Physica A, 2022). First, we show that Bai et al ’s scheme is vulnerable to collusion attack by m − 1 dishonest participants when m − 1 ⩾ t , where t is the threshold value. Second, we point that Bai et al ’s scheme is insecure under our defined attack model—the latent attack. In this work, a possible improved scheme is proposed to overcome the security flaws and halve the computational cost.Abstract As a fundamental component of quantum cryptography, quantum secret sharing (SS) faces a critical security challenge: dishonest participants may gain exclusive access to the shared secret through deceptive actions. To address this, recent advances in fair quantum SS have emerged, allowing equitable secret access among all participants. However, our analysis reveals security vulnerabilities in Bai et al ’s fair quantum SS scheme (Physica A, 2022). First, we show that Bai et al ’s scheme is vulnerable to collusion attack by m − 1 dishonest participants when m − 1 ⩾ t , where t is the threshold value. Second, we point that Bai et al ’s scheme is insecure under our defined attack model—the latent attack. In this work, a possible improved scheme is proposed to overcome the security flaws and halve the computational cost.

Journal of Physics A Mathematical and TheoreticalOct 29, 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

(

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.