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

arXiv:1803.00216

Comment on (t, n) Threshold d-level Quantum Secret Sharing

Shih-Hung Kao, Tzonelih Hwang

Published Mar 1, 2018• 7 citations
arXivHTMLPDF

Abstract

This comment points out a problem in Song et al.'s (t, n) threshold quantum secret sharing [Scientific Reports, Vol. 7, No. 1 (2017), pp. 6366], indicating that the agent is unable to obtain the expected information.
DOI
10.48550/arxiv.1803.00216

Related papers

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

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

Reply to: Comment on (t, n) Threshold d-level Quantum Secret Sharing

Chuang Li, Zhang, Longwei, Xiuli Song

A corresponding comment, raised by Kao and Hwang, claims that the reconstructor Bob1 is unable to obtain the expected secret information in (t, n) Threshold d-level Quantum Secret Sharing (TDQSS)[Scientific Reports, Vol. 7, No. 1 (2017), pp.6366] . In this reply, we show the TDQSS scheme can obtain the dealer's secret information in the condition of adding a step on disentanglement.

arXiv:2106.05488•Jun 10, 2021•0 citations

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

Security analysis and improvement on a d-level quantum secret sharing scheme with cheat-detection (t, m) threshold

Zixin Gao, Jiansheng Guo, Yuehua Li +1 more

Quantum Information Processing•Jul 8, 2025•1 citation

Dynamic (t,n) threshold quantum secret sharing based on d -dimensional Bell state

Fulin Li, Tingyan Chen, Shixin Zhu

Physica A Statistical Mechanics and its Applications•Aug 27, 2022•25 citations
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.
(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.