Verifiable threshold quantum secret sharing with sequential communication

Abstract

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 d-level quantum system to recover secret. Besides, the scheme provides a verification mechanism which 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. Moreover, the scheme is scalable in participant number 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 from other classical threshold secret sharing.

Security of Verifiable Threshold Quantum Secret Sharing With Sequential Communication

“…In this section, let us give a brief description of the verifiable (t, n) threshold quantum secret sharing scheme with sequential communication [22], which includes both the classical private share distribution phase and the secret sharing phase. Moreover, a dealer Alice and n agents Bob 1 , Bob 2 , .…”

“…To better understand the verifiable threshold quantum secret sharing scheme and its cryptanalysis, a simple introduction on the cyclic property of mutually unbiased bases (MUBs) is firstly given [15]. It has been shown that if d is an odd prime, then there are [22], where…”

“…Recently, a verifiable (t, n) threshold quantum secret sharing scheme with sequential communication was proposed based on a single d-level quantum system [22]. Compared with the existing quantum secret sharing schemes, this scheme stands out with the following advantages.…”

“…In this paper, we analyze the security of the verifiable (t, n) threshold quantum secret sharing scheme [22] and then give two new participant attacks. Using the first attack, the first participant Bob 1 can obtain the dealer's secrets by himself with nonzero probability without being detected.…”

Improving Continuous Variable Quantum Secret Sharing with Weak Coherent States

“…The dealer distributes a secret message s to n participants which at least t ≤ n participants combine to recover the secret. It is known as a (t, n)-threshold scheme [2][3][4][5][6][7][8][9]. Quantum secret sharing (QSS) is an extension of classical secret sharing via quantum states.…”