2017
DOI: 10.1103/physreva.95.012315
|View full text |Cite
|
Sign up to set email alerts
|

Unconditional security of entanglement-based continuous-variable quantum secret sharing

Abstract: The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
107
0
1

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 148 publications
(108 citation statements)
references
References 66 publications
(108 reference statements)
0
107
0
1
Order By: Relevance
“…If this is the case, Bob is said to steer Alice's state. In practical applications [26,27], steering is important when Alice does not trust Bob, since it allows Alice to verify that strong quantum correlations are present and that Bob conveyed the correct measurement outcomes. The only condition is that Alice should trust her own setup.…”
mentioning
confidence: 99%
“…If this is the case, Bob is said to steer Alice's state. In practical applications [26,27], steering is important when Alice does not trust Bob, since it allows Alice to verify that strong quantum correlations are present and that Bob conveyed the correct measurement outcomes. The only condition is that Alice should trust her own setup.…”
mentioning
confidence: 99%
“…QSS can be implemented when the players are sepa-rated in a local quantum network and collaborate to decode the secret sent by the dealer who owns the other one mode [31]. In this case, the dealer must not be steered by any one of two players; only the collective steerability is needed.…”
Section: Discussionmentioning
confidence: 99%
“…The graph state is a basic resource in quantum information and quantum computation. For example, multiparty Greenberger-Horne-Zeilinger (GHZ) state and cluster state have been used in quantum communication [31][32][33][34][35] and one-way quantum computation [36,37], respectively.…”
Section: Introductionmentioning
confidence: 99%
“…By choosing an appropriate beam splitting ratio, the additional loss introduced by each player's system can be extremely small, making the protocol extendable to a large number of players. Furthermore, by extending the ideas introduced in [15], we prove the general security of the proposed protocol against both eavesdroppers and dishonest players in the presence of high channel loss. This paper is organized as follows: In Section II, we present details of the proposed QSS scheme and provide a general security proof.…”
Section: Introductionmentioning
confidence: 88%
“…The security analysis of a QSS protocol is typically more involved than that of QKD. The general security proof against both eavesdroppers in the channels and dishonest players only appeared recently [15]. In [15], the dealer prepares a multiparty continuous-variable entangled state, keeps one mode and distributes the other modes to the players.…”
mentioning
confidence: 99%