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

Scientific Reports

Enhanced (t, n) threshold d-level quantum secret sharing

Kartick Sutradhar, Hari Om

Published Aug 24, 2021• 27 citations
Publisher

Abstract

The quantum secret sharing is an essential and fundamental technique for sharing a secret with the all participants in quantum cryptography. It can be used to design many complex protocols such as secure multiparty summation, multiplication, sorting, voting, etc. Recently, Song et al. have discussed a quantum protocol for secret sharing, which has (t, n) threshold approach and modulo d, where t and n denote the threshold number of participants and total number of participants, respectively. Kao et al. point out that the secret in the Song et al.'s protocol cannot be reconstructed without other participants' information. In this paper, we discuss a protocol that overcomes this problem.

DOI
10.1038/s41598-021-96634-8

Related papers

Threshold Quantum Secret Sharing

Kartick Sutradhar

One crucial and basic method for disclosing a secret to every participant in quantum cryptography is quantum secret sharing. Numerous intricate protocols, including secure multiparty summation, multiplication, sorting, voting, and more, can be designed with it. A quantum secret sharing protocol with a $(t,n)$ threshold approach and modulo d, where t and n represent the threshold number of participants and the total number of participants, respectively was recently discussed by Song et al. Kao et al. notes that without the information of other participants, the secret in Song {\em et al.'s}protocol cannot be reconstructed. We address a protocol that solves this issue in this paper.

arXiv:2501.09559•Jan 16, 2025•0 citations

Improvement of a (t,n) Threshold d−Level Quantum Secret Sharing Scheme

Samaneh Mashhadi

Recently, a threshold d−level quantum secret sharing scheme was presented by Song et al. However, Kao et al. showed that in contrary to Song claim, the reconstructor cannot recover the secret without receiving any information from the other participants. To remedy this weakness, we will propose a new version of Song scheme.

Journal of Applied Security Research•Nov 11, 2020•21 citations

An Efficient Simulation of Quantum Secret Sharing

Kartick Sutradhar, Hari Om

In quantum cryptography, quantum secret sharing $(QSS)$ is a fundamental primitive. $QSS$ can be used to create complex and secure multiparty quantum protocols. Existing $QSS$ protocols are either at the $(n, n)$ threshold $2$ level or at the $(t, n)$ threshold $d$ level with a trusted player, where $n$ denotes the number of players and $t$ denotes the threshold number of players. Here, we propose a secure $d$-level $QSS$ protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing $QSS$ protocols: $(n, n)$ threshold $2$-level and $(t,n)$ threshold $d$-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.

arXiv:2103.11206•Mar 20, 2021•1 citation

$(t, n)$ Threshold $d$-level quantum secret sharing based on quantum Fourier transformation

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•Sep 30, 2020•0 citations

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

Quantum Information and Computation•Sep 1, 2020•1 citation

Multiparty Quantum Secret Sharing Using Quantum Fourier Transform

Dazu Huang, Zhigang Chen, Ying Guo

A (n, n)-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Furthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.

Communications in Theoretical Physics•Feb 1, 2009•12 citations
The quantum secret sharing is an essential and fundamental technique for sharing a secret with the all participants in quantum cryptography. It can be used to design many complex protocols such as secure multiparty summation, multiplication, sorting, voting, etc. Recently, Song et al. have discussed a quantum protocol for secret sharing, which has (t, n) threshold approach and modulo d, where t and n denote the threshold number of participants and total number of participants, respectively. Kao et al. point out that the secret in the Song et al.'s protocol cannot be reconstructed without other participants' information. In this paper, we discuss a protocol that overcomes this problem.
One crucial and basic method for disclosing a secret to every participant in quantum cryptography is quantum secret sharing. Numerous intricate protocols, including secure multiparty summation, multiplication, sorting, voting, and more, can be designed with it. A quantum secret sharing protocol with a (t,n)(t,n)(t,n) threshold approach and modulo d, where t and n represent the threshold number of participants and the total number of participants, respectively was recently discussed by Song et al. Kao et al. notes that without the information of other participants, the secret in Song {\em et al.'s}protocol cannot be reconstructed. We address a protocol that solves this issue in this paper.
In quantum cryptography, quantum secret sharing (QSS)(QSS)(QSS) is a fundamental primitive. QSSQSSQSS can be used to create complex and secure multiparty quantum protocols. Existing QSSQSSQSS protocols are either at the (n,n)(n, n)(n,n) threshold 222 level or at the (t,n)(t, n)(t,n) threshold ddd level with a trusted player, where nnn denotes the number of players and ttt denotes the threshold number of players. Here, we propose a secure ddd-level QSSQSSQSS protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing QSSQSSQSS protocols: (n,n)(n, n)(n,n) threshold 222-level and (t,n)(t,n)(t,n) threshold ddd-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.
(t,n)(t, n)(t,n) Threshold ddd-level quantum secret sharing based on quantum Fourier transformation
Quantum secret sharing (QSS) is an important branch of secure multiparty quantum computation. Several schemes for (n,n)(n, n)(n,n) threshold QSS based on quantum Fourier transformation (QFT) have been proposed. Inspired by the flexibility of (t,n)(t, n)(t,n) threshold schemes, Song {\it et al.} (Scientific Reports, 2017) have proposed a (t,n)(t, n)(t,n) threshold QSS utilizing QFTQFTQFT. 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)(t, n)(t,n) threshold QSS scheme to share a ddd dimensional classical secret. This scheme can be implemented using local operations (such as QFTQFTQFT, generalized Pauli operators and local measurement) and classical communication. Security of the proposed scheme is described against outsider and participants' eavesdropping.
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.
A (n, n)-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Furthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.