Sequential Quantum Secret Sharing Using a Single Qudit

To detect frauds by a dealer or some participants, researchers have proposed verifiable threshold quantum state sharing (VTQSTS) schemes. However, the existing VTQSTS schemes either have lowcomputation efficiency or weak security. In this paper, a verifiable (t, n) threshold quantum state sharing against denial attack (VTQSTS-ADA) scheme is proposed to overcome the above limitations, in which the dealer Alice encodes the quantum secret sequence into two quantum message sequences and a quantum signature sequence. First, for each participant in the authorization subset, the received quantum signature sequence is validated by a quantum verification algorithm, and then a unitary transformation with a rotation key is performed on the received quantum message sequence; next, a new quantum signature sequence is generated by a quantum signature algorithm with the signature key. Each participant sends the new message sequences and signature sequence to the next participant. The original quantum secret sequence can be reconstructed when t(t ≤ n) participants collaborate. The security analysis shows that the proposed VTQSTS-ADA scheme can detect the fraud instances raised by the dealer and participants and provide stronger security such as resisting denial attacks and man-in-middle attacks compared with the existing schemes. The performance analysis shows that the proposed VTQSTS-ADA scheme outperforms the earlier VTQSTS scheme and is comparable to the recent scheme.INDEX TERMS Threshold quantum state sharing, quantum state digital signature, denial attack, man-in-middle attack.

show abstract

“…3 )|ϕ 1 , (σ k (6) 1 W k (5) σ k (4) 3 )|ϕ 2 , (σ k (9) 1 W k (8) σ k (7) 3 )|ϕ 3 , (σ k (12) 1 W k (11) σ k (10) 3…”

Section: Examplementioning

confidence: 99%

“…Some of the existing QSS schemes are of the (n, n) threshold type, which requires all participants together to reconstruct the secret [2]- [10]. To improve the flexibility and practicability of the (n, n) threshold QSS schemes, some (t, n) threshold QSS schemes (TQSS) [11]- [20] have been proposed.…”

Section: Introductionmentioning

confidence: 99%

A Verifiable $(t, n)$ Threshold Quantum State Sharing Against Denial Attack

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Therefore, it has overwhelming advantages in the information security, and its development is extremely rapid. Nowadays, the research of quantum cryptography is extremely active in the fields of quantum key distribution (QKD) [1,2,3,4], quantum secret sharing (QSS) [5,6,7] and quantum secure direct communication (QSDC) [8,9]. Unlike the QKD protocols, quantum key agreement (QKA) [10,11,12,13,14] is a new important branch that each participant plays an equivalent role on generating the shared key.…”

Section: Introductionmentioning

confidence: 99%

“…2) In the process of transmitting the information by the subsequences, the decoy particles are always inserted randomly to resist the eavesdropping attacks. 3) Before recovering the shared key, the trusted design combiner (TDC) [6] will use the homomorphic hash function [29] to detect the received information, which can not only ensure the privacy of the shared key before all participants complete the operation, but also ensure the correctness and simultaneous of the recovered shared key. 4) The shared key is recovered by all participants, and the participant attacks can be resisted successfully.…”

Section: Introductionmentioning

confidence: 99%

A verifiable quantum key agreement protocol based on six-qubit cluster states

Liu,

2020

Preprint

Self Cite

View full text Add to dashboard Cite

With the emergence of the multi-party quantum key agreement, the participant attack has attracted great attention, since it is a destructive attack which is easier to obtain the effective information than the external attack. In this paper, a new multi-party quantum key agreement protocol with six-qubit cluster states which has the verification function is put forward. At first, a verifiable distributor is introduced to distribute the remaining information of six-qubit cluster states to any two adjacent participants after preserving a part. Next, once the participants verify the correctness of the received information with the properties of six-qubit cluster states under the X-basis, the cluster states are used as the quantum resource to perform the X operation in the participant operation phase. Finally, it can not only verify the correctness of the recovered shared key, but also guarantee its simultaneity through the trusted design combiner and homomorphic hash function. Furthermore, the security analysis shows that the new protocol can resist the external and internal attacks. And it's proved that our protocol is meaningful through the comparation analysis.

show abstract

“…The former presents various characteristics in the scheme design, while the latter is mostly realized by means of quantum entanglement swapping and quantum teleportation. Many QSS schemes are (n, n) threshold [18,19,20] that need all participants to reconstruct the secret together. In order to improve the flexibility and practicability, the (t, n) threshold quantum secret sharing (TQSS) schemes [14,21,22,23] were proposed.…”

Section: Introductionmentioning

confidence: 99%

A quantum secret sharing scheme with verifiable function

Liu,

Li,

Han

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

In the (t, n) threshold quantum secret sharing scheme, it is difficult to ensure that internal participants are honest. In this paper, a verifiable (t, n) threshold quantum secret sharing scheme is designed combined with classical secret sharing scheme. First of all, the distributor uses the asymmetric binary polynomials to generate the shares and sends them to each participant. Secondly, the distributor sends the initial quantum state with the secret to the first participant, and each participant performs unitary operation that using the mutually unbiased bases on the obtained d dimension single bit quantum state (d is a large odd prime number). In this process, distributor can randomly check the participants, and find out the internal fraudsters by unitary inverse operation gradually upward. Then the secret is reconstructed after all other participants simultaneously public transmission. Security analysis show that this scheme can resist both external and internal attacks.

show abstract

Sequential Quantum Secret Sharing Using a Single Qudit

Cited by 17 publications

References 34 publications

A Verifiable $(t, n)$ Threshold Quantum State Sharing Against Denial Attack

A Verifiable $(t, n)$ Threshold Quantum State Sharing Against Denial Attack

A verifiable quantum key agreement protocol based on six-qubit cluster states

A quantum secret sharing scheme with verifiable function

Contact Info

Product

Resources

About