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

IEEE Access

$(t,n)$ -Threshold Quantum Secret Sharing Based on One-Way Local Distinguishability

Chen‐Ming Bai, Sujuan Zhang, Lu Liu

Published Jan 1, 2019• 11 citations
Publisher

Abstract

We propose a quantum secret sharing protocol with a set of orthogonal generalized Bell states and one-way local distinguishability. In the proposed protocol, the participants use local projective measurements and one-way classical communication to distinguish among four Bell states, and we combine with the Shamir (t,n) -threshold scheme to realize (t,n) -threshold access structure. Compared to the existing schemes, the practical communication costs are dramatically improved as there is need for one-way classic communication between the two participants in our protocol. In addition, the efficiency in the process of information transmission will also be improved, as the number of communications will be reduced. At last, we demonstrate our protocol to be secure against both eavesdropping and dishonest participants.

DOI
10.1109/access.2019.2946316

Related papers

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

•Oct 31, 2017•0 citations

Quantum scheme for secret sharing based on local distinguishability

Ramij Rahaman, Matthew Geoffrey Parker

In this paper, we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis, we propose a quantum secret sharing scheme (which we call LOCC-QSS). Our LOCC-QSS scheme is quite general and cost efficient compared to other schemes. In our scheme, no joint quantum operation is needed to reconstruct the secret. We also present an interesting $(2,n)$-threshold LOCC-QSS scheme, where any two cooperating players, one from each of two disjoint groups of players, can always reconstruct the secret. This LOCC-QSS scheme is quite uncommon, as most $(k,n)$-threshold quantum secret sharing schemes have the restriction $k\ensuremath{\ge}\ensuremath{\lceil}\frac{n}{2}\ensuremath{\rceil}$.

arXiv:1403.1097•Physical Review A•Feb 20, 2015•149 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

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

Lei Li, Zhi Zhou Li

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.

Entropy•Jan 31, 2023•12 citations

Construction of a Class of Communication-Efficient Quantum Secret Sharing Schemes

Chenhao Li, Zhihui Li, Jiansheng Guo +2 more

Quantum secret sharing is a fundamental technique in quantum cryptography. However, in practical quantum networks, it still faces several bottlenecks, such as high quantum communication cost and low transmission efficiency. To reduce the communication cost, ramp quantum secret sharing schemes have been proposed in existing studies. Nevertheless, intermediate sets in such schemes may leak partial information about the secret. To address this problem, this paper presents a method for detecting intermediate sets. Based on this method, we further propose a communication-efficient perfect quantum secret sharing scheme with eavesdropping detection capability.We analyze the communication cost under different numbers of participating parties and determine the range of participants that minimizes the reconstruction communication cost. The results verify the communication efficiency and security of the proposed scheme.

quant-pharXiv:2607.19891•Entropy•Jul 23, 2026•1 citation

(t,n) Threshold d-level QSS based on QFT

Sarbani Roy, Sourav Mukhopadhyay

Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for (n, n) threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of (t, n) threshold schemes, Song {\it et al.} (Scientific Reports, 2017) have proposed a (t, n) threshold QSS utilizing QFT. Later, Kao and Hwang (arXiv:1803.00216) have identified a {loophole} in the scheme but have not suggested any remedy. In this present study, we have proposed a (t, n)threshold QSS scheme to share a d dimensional classical secret. This scheme can be implemented using local operations (such as QFT, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.

arXiv:2009.14598•Quantum Information and Computation•Sep 1, 2020•2 citations
(t,n)(t,n)(t,n) -Threshold Quantum Secret Sharing Based on One-Way Local Distinguishability
We propose a quantum secret sharing protocol with a set of orthogonal generalized Bell states and one-way local distinguishability. In the proposed protocol, the participants use local projective measurements and one-way classical communication to distinguish among four Bell states, and we combine with the Shamir (t,n) -threshold scheme to realize (t,n) -threshold access structure. Compared to the existing schemes, the practical communication costs are dramatically improved as there is need for one-way classic communication between the two participants in our protocol. In addition, the efficiency in the process of information transmission will also be improved, as the number of communications will be reduced. At last, we demonstrate our protocol to be secure against both eavesdropping and dishonest participants.
(ttt, nnn) Threshold Quantum Secret Sharing based on a Single ddd-level Quantum System
A (ttt, nnn) threshold quantum secret sharing (QSS) is proposed based on a single ddd-level quantum system. It enables the (ttt, nnn) threshold structure based on Shamir's secret sharing and simply requires sequential communication in the ddd-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 (ttt, nnn) threshold QSS schemes based on ddd-level quantum system with other classical threshold secret sharing.
In this paper, we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis, we propose a quantum secret sharing scheme (which we call LOCC-QSS). Our LOCC-QSS scheme is quite general and cost efficient compared to other schemes. In our scheme, no joint quantum operation is needed to reconstruct the secret. We also present an interesting (2,n)(2,n)(2,n)-threshold LOCC-QSS scheme, where any two cooperating players, one from each of two disjoint groups of players, can always reconstruct the secret. This LOCC-QSS scheme is quite uncommon, as most (k,n)(k,n)(k,n)-threshold quantum secret sharing schemes have the restriction $k\ensuremath{\ge}\ensuremath{\lceil}\frac{n}{2}\ensuremath{\rceil}$.
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%.
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.
Quantum secret sharing is a fundamental technique in quantum cryptography. However, in practical quantum networks, it still faces several bottlenecks, such as high quantum communication cost and low transmission efficiency. To reduce the communication cost, ramp quantum secret sharing schemes have been proposed in existing studies. Nevertheless, intermediate sets in such schemes may leak partial information about the secret. To address this problem, this paper presents a method for detecting intermediate sets. Based on this method, we further propose a communication-efficient perfect quantum secret sharing scheme with eavesdropping detection capability.We analyze the communication cost under different numbers of participating parties and determine the range of participants that minimizes the reconstruction communication cost. The results verify the communication efficiency and security of the proposed scheme.
Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for (n, n) threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of (t, n) threshold schemes, Song {\it et al.} (Scientific Reports, 2017) have proposed a (t, n) threshold QSS utilizing QFT. Later, Kao and Hwang (arXiv:1803.00216) have identified a {loophole} in the scheme but have not suggested any remedy. In this present study, we have proposed a (t, n)threshold QSS scheme to share a d dimensional classical secret. This scheme can be implemented using local operations (such as QFT, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.