Quantum secret sharing using orthogonal multiqudit entangled states

Bai, Chen-Ming; Li, Zhihui; Liu, Chengji; Li, Yongming

doi:10.1007/s11128-017-1739-z

Cited by 29 publications

(11 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“… In 2017, Bai 28 proposed a standard (2, n )-threshold LOCC-QSS scheme and a restricted (2, n )-threshold LOCC-QSS scheme based on the local distinguishability of an orthogonal pair of n -qudit GHZ states. In 2017, using the discriminability of two orthogonal d -level GHZ states under LOCC, Bai 47 proposed multiple QSS schemes to realize three types of access structures, i.e., the ( n , n )-threshold, the restricted (3, n )-threshold and restricted (4, n )-threshold. In 2017, Wang 48 proposed the concept of judgment space to investigate the quantum secret sharing scheme based on local distinguishability, and developed a standard (3, 4)-threshold LOCC-QSS scheme and a standard (5, 6)-threshold LOCC-QSS scheme with three orthogonal 4-qudit (4-level) entangled states and three orthogonal 6-qudit (6-level) entangled states, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Standard (3, 5)-threshold quantum secret sharing by maximally entangled 6-qubit states

Long¹,

Zhang

Sun

2021

Sci Rep

View full text Add to dashboard Cite

In this paper, a standard (3, 5)-threshold quantum secret sharing scheme is presented, in which any three of five participants can resume cooperatively the classical secret from the dealer, but one or two shares contain absolutely no information about the secret. Our scheme can be fulfilled by using the singular properties of maximally entangled 6-qubit states found by Borras. We analyze the scheme’s security by several ways, for example, intercept-and-resend attack, entangle-and-measure attack, and so on. Compared with the other standard threshold quantum secret sharing schemes, our scheme needs neither to use d-level multipartite entangled states, nor to produce shares by classical secret splitting techniques, so it is feasible to be realized.

show abstract

Section: Introductionmentioning

confidence: 99%

“…In 2017, using the discriminability of two orthogonal d -level GHZ states under LOCC, Bai 47 proposed multiple QSS schemes to realize three types of access structures, i.e., the ( n , n )-threshold, the restricted (3, n )-threshold and restricted (4, n )-threshold.…”

Section: Introductionmentioning

confidence: 99%

Standard (3, 5)-threshold quantum secret sharing by maximally entangled 6-qubit states

Long¹,

Zhang

Sun

2021

Sci Rep

View full text Add to dashboard Cite

show abstract

“…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. The TQSS schemes require t or more than t participants out of n participants together to reconstruct the secret.…”

Section: Introductionmentioning

confidence: 99%

“…At the same time, some schemes are designed by combining several types of threshold structures. As an example, Bai et al [20] proposed a TQSS to realize three types of access structures, i.e., (n, n) threshold, restricted (3, n) threshold, and restricted (4, n) threshold.…”

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

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

“…We also provide another algorithm achieving concentrating quantum information using exact state merging, and show that the entanglement cost of concentrating quantum information can be reduced compared to that of spreading quantum information. During spreading and concentrating quantum information, coherence has to be kept, and this point is contrasted with encoding and decoding classical information in quantum states shared among multiple parties investigated in the context of a type of quantum secret sharing based on LOCC state distinguishability . Our algorithms for spreading and concentrating quantum information are applicable to any isometry representing encoding and decoding and provide an algorithm for one‐shot distributed source compression applicable to arbitrarily small‐dimensional systems and a general algorithm for LOCC‐assisted decoding of shared quantum information having studied in the context of quantum secret sharing …”

Section: Introductionmentioning

confidence: 99%

Distributed Encoding and Decoding of Quantum Information over Networks

Yamasaki

Murao

2018

Adv Quantum Tech

View full text Add to dashboard Cite

Encoding and decoding quantum information in a multipartite quantum system are indispensable for quantum error correction and also play crucial roles in multiparty tasks in distributed quantum information processing such as quantum secret sharing. To quantitatively characterize nonlocal properties of multipartite quantum transformations for encoding and decoding, we analyze the entanglement costs of encoding and decoding quantum information in a multipartite quantum system distributed among spatially separated parties connected by a network. This analysis generalizes previous studies of entanglement costs for preparing bipartite and multipartite quantum states and implementing bipartite quantum transformations by entanglement‐assisted local operations and classical communication (LOCC). We identify conditions for the parties being able to encode or decode quantum information in the distributed quantum system deterministically and exactly, when inter‐party quantum communication is restricted to a tree‐topology network. In our analysis, we reduce the multiparty tasks of implementing the encoding and decoding to sequential applications of one‐shot zero‐error quantum state splitting and merging for two parties. While encoding and decoding are inverse tasks of each other, our results suggest that a quantitative difference in entanglement cost between encoding and decoding arises due to the difference between quantum state merging and splitting.

show abstract

Quantum secret sharing using orthogonal multiqudit entangled states

Cited by 29 publications

References 40 publications

Standard (3, 5)-threshold quantum secret sharing by maximally entangled 6-qubit states

Standard (3, 5)-threshold quantum secret sharing by maximally entangled 6-qubit states

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

Distributed Encoding and Decoding of Quantum Information over Networks

Contact Info

Product

Resources

About