A verifiable (k, n)-threshold dynamic quantum secret sharing scheme

Li, Fulin; Hu, Hang; Zhu, Shixin; Yan, Jiayun; Ding, Jian

doi:10.1007/s11128-022-03617-3

Cited by 25 publications

(24 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 1999, Hillery et al [11] proposed the first quantum secret sharing (QSS) scheme based on the entanglement properties of GHZ (Greenberger Horne Zeilinger) state. Since then, more and more quantum secret sharing schemes [12][13][14][15][16][17][18][19][20][21] have been proposed. Compared with classical secret sharing, quantum secret sharing shares secrets through quantum operations, so, the security of the scheme is based on quantum theory, such as the non-cloning theorem of quantum mechanics, Heisenberg uncertainty principle and the principle of indistinguish ability of non-orthogonal quantum states.…”

Section: Introductionmentioning

confidence: 99%

“…For example, In 2019, Chen et al [12] proposed a flexible evaluator two-dimensional quantum homomorphic encryption scheme based on (k, n) threshold quantum state sharing, In 2022, Wang et al [14] constructed a threshold QSS scheme by using rotation operation. At the same time, some quantum secret sharing schemes in high-dimensional space have been proposed [15][16][17][18][19]21]. However, there are problems with some of these schemes, for example, in 2018, Song et al [13] proposed a QSS scheme with (t, n) threshold.…”

Section: Introductionmentioning

confidence: 99%

“…In literature [24], Lu et al used unitary operation to construct a quantum secret sharing scheme, the disadvantage of this scheme is that it is impossible to verify whether the recovered secret is the original secret. On the other hand, in the quantum secret sharing schemes [12][13][14][15][16][17][18][19][20][21] mentioned above, threshold quantum secret sharing schemes accounts for a large proportion. For example, (n, n) threshold QSS schemes [15,19] and (t, n) threshold QSS schemes [12][13][14][16][17][18].…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, in the quantum secret sharing schemes [12][13][14][15][16][17][18][19][20][21] mentioned above, threshold quantum secret sharing schemes accounts for a large proportion. For example, (n, n) threshold QSS schemes [15,19] and (t, n) threshold QSS schemes [12][13][14][16][17][18]. In the (t, n) threshold QSS scheme, the size of each authorized set is at leas t(t ≤ n), that is, the secret can be recovered only when at least t participants participate in cooperation, and the secret cannot be recovered if less than t participants.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient Quantum Secret Sharing Scheme Based On Monotone Span Program

Luo¹,

Li²,

Meng³

et al. 2023

Preprint

View full text Add to dashboard Cite

How to efficiently share secrets among multiple participants is a very important problem in key management. In this paper, we propose a multi-secret sharing scheme based on the GHZ state. First, the distributor uses monotone span program to encode the secrets and generate the corresponding secret shares to send to the participants. Then, each participant uses the generalized Pauli operator to embed its own secret share into the transmitted particle. The participant who wants to get the secrets can get multiple secrets at the same time by performing a GHZ-state joint measurement. Futhermore, the scheme is based on a monotone span program, and its access structure is more general than the access structure (t, n) threshold. Compared with other schemes, our proposed scheme is more efficient, less computational cost.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Quantum Secret Sharing Scheme Based On Monotone Span Program

Luo¹,

Li²,

Meng³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Since then, an increasing number of QSS protocols have been proposed based on different techniques, such as quantum entanglement swapping, [4][5][6] quantum Fourier transform, [7][8][9] and so on. [10][11][12] Recently, some high-dimensional QSS protocols and experiments have been studied. Li et at.…”

Section: Introductionmentioning

confidence: 99%

Quantum Secret Reconstruction

Ma,

Gao,

Cai

et al. 2023

Adv Quantum Tech

View full text Add to dashboard Cite

In addition to secret splitting, secret reconstruction is another important component of secret sharing. In this paper, the first quantum secret reconstruction protocol is proposed to protect the reconstruction process. Before the protocol, a classical secret is divided into multiple shares that are distributed to the shareholds, respectively. In the presented protocol, the dealer utilizes the secret to encrypt a privacy quantum state, and sends the encrypted state to a combiner who is chosen by the dealer within the shareholders. With the help of other shareholders, the combiner utilizes the properties of cluster states to recover the privacy quantum state. It is shown that the proposed protocol is secure against several common attacks, including external and internal attacks. Compared with classical secret reconstruction protocols, this protocol not only achieves information‐theoretic security of all shares, but is also more efficient due to the reduced distribution and computation cost. To demonstrate the feasibility of the protocol, a corresponding simulation quantum experiment is conducted on the IBM Q. Furthermore, in conjunction with quantum fingerprinting, it can be directly applied to achieve the task of quantum multiple secrets sharing, since the classical shares can be reused in the proposed protocol.

show abstract

Controlled Cyclic and Bidirectional Hybrid Quantum Communication of Arbitrary Two‐Qubit States

Gong,

Chen,

et al. 2024

Adv Quantum Tech

View full text Add to dashboard Cite

Hybrid quantum communication with the combination of quantum teleportation and remote preparation is hopeful for promoting the development of quantum networks and enriching the diversity of quantum network communication. To improve the communication efficiency and enhance the scalability of the quantum networks, a meaningful protocol for controlled cyclic and bidirectional hybrid quantum communication of arbitrary two‐qubit states is proposed, which allows quantum information to be transmitted simultaneously in both directions among multiple participants. With the permission of one controller, each observer can simultaneously transmit arbitrary known two‐qubit states and unknown ones to their adjacent observers, by implementing remote preparation and quantum teleportation in the clockwise and counterclockwise directions. Furthermore, the participants just carry out some quantum measurements and recovery operations to achieve the communication target, and the desired states can be attained with a unit success probability, thus the protocol is deterministic. Finally, some comparisons are also made with other similar protocols, which shows that the protocol is better in qubit efficiency and communication capacity.

show abstract

A verifiable (k, n)-threshold dynamic quantum secret sharing scheme

Cited by 25 publications

References 32 publications

Efficient Quantum Secret Sharing Scheme Based On Monotone Span Program

Efficient Quantum Secret Sharing Scheme Based On Monotone Span Program

Quantum Secret Reconstruction

Controlled Cyclic and Bidirectional Hybrid Quantum Communication of Arbitrary Two‐Qubit States

Contact Info

Product

Resources

About