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:2106.05488

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

Chuang Li, Zhang, Longwei, Xiuli Song

Published Jun 10, 2021• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2106.05488

Related papers

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

Shih-Hung Kao, Tzonelih Hwang

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.

arXiv:1803.00216•Mar 1, 2018•7 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

(t, n) Threshold d-Level Quantum Secret Sharing

Xiuli Song, Yanbing Liu, Hongyao Deng +1 more

Abstract Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.

Scientific Reports•Jul 19, 2017•59 citations

Reply to Comments on "Quantum Key Distribution for d-level systems for generalized Bell states" [Phys. Rev. A, 052331, (2002)] and "Quantum secret sharing based on a reusable Greenberger-Horne -Zeilinger states as secure carriers" [Phys. Rev. A, 67, 044302, (2003)]"

Vahid Karimipour

We show that the criticisms of two recent comments \\cite{ch1,ch2} on the insecurity of quantum key distributions proposed in \\cite{zhang} and \\cite{v1} and the secret sharing protocol proposed in \\cite{v2} are based on a misconception about the meaning of security and hence are invalid.

•Jun 17, 2005•2 citations

Reply to “Comment II on ‘Quantum secret sharing based on reusable Greenberger-Horne-Zeilinger states as secure carriers’ ”

Vahid Karimipour

In the preceding Comment [Jian-Zhong Du, Su-Juan Qin, Qiao-Yan Wen, and Fu-Chen Zhu, Phys. Rev. A 74, 016301 (2006)], it has been shown that in a quantum secret sharing protocol proposed in [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], one of the receivers can cheat by splitting the entanglement of the carrier and intercepting the secret, without being detected. In this reply we show that a simple modification of the protocol prevents the receivers from this kind of cheating.

arXiv:quant-ph/0605099•Physical Review A•Jul 21, 2006•3 citations

Comment on “Reply to Comment on ‘Efficient High-Capacity Quantum Secret Sharing with Two-Photon Entanglement’ ”

Zhenchao Zhu, Yuqing Zhang, Anmin Fu

International Journal of Theoretical Physics•Oct 19, 2010•1 citation
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.
Abstract Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.
In the preceding Comment [Jian-Zhong Du, Su-Juan Qin, Qiao-Yan Wen, and Fu-Chen Zhu, Phys. Rev. A 74, 016301 (2006)], it has been shown that in a quantum secret sharing protocol proposed in [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], one of the receivers can cheat by splitting the entanglement of the carrier and intercepting the secret, without being detected. In this reply we show that a simple modification of the protocol prevents the receivers from this kind of cheating.