Cheating identifiable (k, n) threshold quantum secret sharing scheme

Yan, Chenhong; Li, Zhihui; Liu, Lu; Lu, Dianjun

doi:10.1007/s11128-021-03343-2

Cited by 15 publications

(8 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The schemes [18][19][20][21] are all (t, n) threshold QSS schemes that cannot verify the correctness of the recovered secret. Our scheme and the schemes [27][28][29][30][31] are verifiable (t, n) threshold QSS schemes in which the participants can verify the correctness of the recovered secret.…”

Section: Comparisonmentioning

confidence: 99%

“…After that, many QSS schemes were proposed. Such as (n, n) threshold QSS schemes [12][13][14], (t, n) threshold QSS schemes [15][16][17][18][19][20], multiparty-to-multiparty QSS schemes [21,22], access structure-based QSS schemes [23,24] and dynamic QSS schemes [25,26]. In (n, n) threshold QSS schemes all participants must cooperate together to recover the secret.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A verifiable (t,n) threshold quantum secret sharing scheme based on asymmetric binary polynomial

Guan,

Guo,

2023

Laser Phys.

View full text Add to dashboard Cite

Threshold quantum secret sharing is a typical method for quantum secret sharing (QSS) schemes. In this paper, we propose a verifiable t , n threshold QSS scheme based on the d -dimensional Bell state and asymmetric binary polynomial. In this scheme, the dealer encodes the secret using the asymmetric binary polynomial and generates the corresponding secret share for each participant. Then, the dealer prepares the d -dimensional Bell state, and the participants perform corresponding unitary operations on the particles in transmission to recover the secret. With the hash function and the session key pairs, not only the cheating behavior of the dishonest participants can be detected, but also the specific cheaters can be identified. Furthermore, we consider the case when no less than t participants cooperate to recover the secret, which makes the proposed scheme more practical. Analyses show that the scheme can resist forgery attack, collusion attack and other common attacks.

show abstract

Section: Comparisonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A verifiable (t,n) threshold quantum secret sharing scheme based on asymmetric binary polynomial

Guan,

Guo,

2023

Laser Phys.

View full text Add to dashboard Cite

show abstract

“…In addition to the nonlocality detection of a bipartite state, the researchers have extended to the more complex cases, such as more measurements per party [19], sequential measurements [20], multi measurement outcomes [21] and increasing number of parties [22,23], where the increasing number of parties can form different types of quantum networks. Therefore, the topic of network quantum nonlocal correlations are focused on increasingly as the development of the research [24][25][26][27][28][29][30][31][32][33][34][35]. Definitions and inequality criteria of the nonlocal correlations in various quantum networks have been proposed, such as entanglement-swapping networks [24,25], chain networks [26,27], star networks [28,29], triangle networks [30][31][32], tree-shaped networks [33][34][35] and arbitrary acyclic networks [36][37][38].…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, the topic of network quantum nonlocal correlations are focused on increasingly as the development of the research [24][25][26][27][28][29][30][31][32][33][34][35]. Definitions and inequality criteria of the nonlocal correlations in various quantum networks have been proposed, such as entanglement-swapping networks [24,25], chain networks [26,27], star networks [28,29], triangle networks [30][31][32], tree-shaped networks [33][34][35] and arbitrary acyclic networks [36][37][38]. It is well-known that network nonlocality correlations can always be detected if all independent sources of the network are entangled pure bipartite states whatever the scale of the network is.…”

Section: Introductionmentioning

confidence: 99%

Persistency of quantum non-multi-local correlations in noisy acyclic networks

Yang,

Hou,

2024

Phys. Scr.

View full text Add to dashboard Cite

The topic of network quantum nonlocal correlations arises from the large-scale quantum communications. It has been demonstrated that non-m-local correlations (m is the number of sources) in some special kinds of networks will decay under the inﬂuence of noises from imperfect devices as these networks extend, including linear and star networks. Furthermore, we observe that under the same noisy level, persistency of non-multi-local correlations in aforementioned diﬀerent kinds of networks appears obvious discrepancy. Therefore, it becomes a natural and challenging task to check the persistency of non-multi-locality in more complex acyclic network, since star and linear networks can be regarded as acyclic networks. It is worth noting that an acyclic network is one indeterminate forked tree-shaped networks. So the study is focused on the tree-shaped network. We ﬁrst devote to discussing the determinate forked case. We obtain inequality persistency criteria of determinate k-forked tree-shaped network nonlocal correlations. We show that the larger the fork number k is larger, the better the non-multi-locality of this network persists. In the indeterminate forked case, the inequality persistency criteria are also established. We observe that the larger the number of parties in the last layer of an acyclic network, the better the non-multi-locality of this network is persisted. This theoretical research may guide us how to build quantum networks with the stronger correlation in practical communications.

show abstract

“…In 2011, Tseng et al [14] proposed a QSS protocol based on a quantum search algorithm. To address the problem of not being able to check the honesty of participants during the secret recovery process (i.e., dishonest participants will provide false shares in the secret reconstruction phase to steal the secret or make the secret not recovered correctly), verifiable threshold quantum secret sharing (VTQSS) schemes [15][16][17][18][19][20][21][22][23][24] are considered. Verifiability prevents dealer from sharing incorrect shares and forces participants to submit their shares correctly.…”

Section: Introductionmentioning

confidence: 99%

Two (w, ω, n) weighted threshold quantum secret sharing schemes on d-level single quantum systems

Guan,

Guo,

2023

Phys. Scr.

View full text Add to dashboard Cite

Quantum secret sharing occupies an important position in quantum cryptography. In this paper, we propose two ( w , ω , n ) weighted threshold quantum secret sharing schemes on d-level single quantum systems that share classical information and quantum states, respectively. The dealer Alice distributes the secret share to each participant using the Chinese Remainder Theorem(CRT) for a polynomial ring, which can realize secret sharing among participants with different weights. In classical information sharing, the dealer can share multiple secrets in one round of the protocol and the participants can verify the correctness of the recovered secrets. In quantum state sharing, the dealer can share multiple single quantum states in one round of protocol. Finally, we demonstrate that our scheme is resistant to common external and internal attacks and compare it with related schemes.

show abstract

Cheating identifiable (k, n) threshold quantum secret sharing scheme

Cited by 15 publications

References 32 publications

A verifiable (t,n) threshold quantum secret sharing scheme based on asymmetric binary polynomial

A verifiable (t,n) threshold quantum secret sharing scheme based on asymmetric binary polynomial

Persistency of quantum non-multi-local correlations in noisy acyclic networks

Two (w, ω, n) weighted threshold quantum secret sharing schemes on d-level single quantum systems

Contact Info

Product

Resources

About