Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0302156 · Physical Review A

Unified criterion for security of secret sharing in terms of violation of Bell inequalities

Aditi Sen, Ujjwal Sen, Marek Żukowski

Published Sep 17, 2003• 66 citations
arXivHTMLPDF

Abstract

In secret sharing protocols, a secret is to be distributed among several partners such that leaving out any number of them, the rest do not have the complete information. Strong multiqubit correlations in the state by which secret sharing is carried out had been proposed as a criterion for security of such protocols against individual attacks by an eavesdropper. However we show that states with weak multiqubit correlations can also be used for secure secret sharing. That our state has weak multiqubit correlations is shown from the perspective of violation of local realism, and also by showing that its higher-order correlations are described by lower ones. We then present a unified criterion for security of secret sharing in terms of violation of local realism, which works when the secret sharing state is the Greenberger-Horne-Zeilinger state (with strong multiqubit correlations), as well as states of a different class (with weak multiqubit correlations).

DOI
10.1103/physreva.68.032309

Related papers

SECURITY OF MULTIPARTY QUANTUM SECRET SHARING WITH MULTIQUBIT GHZ STATES

Xin-Wen Wang, Deng-Yu Zhang, Shi-Qing Tang +1 more

We study the security of multiparty quantum secret sharing (QSS) with multiqubit Greenberger–Horne–Zeilinger states. We give a detailed proof that the original scheme of Xiao et al. [Phys. Rev. A69 (2004) 052307] is insecure against the interior attack (i.e. the participants' attack) which is the most serious threat for QSS protocols. Thereafter, an improvement of this QSS protocol is proposed.

International Journal of Quantum Information•Dec 1, 2010•2 citations

Quantum key distribution betweenNpartners: Optimal eavesdropping and Bell’s inequalities

Valerio Scarani, Nicolas Gisin

Quantum secret-sharing protocols involving N partners are key distribution protocols in which Alice encodes her key into $N\ensuremath{-}1$ qubits, in such a way that all the other partners must cooperate in order to retrieve the key. On these protocols, several eavesdropping scenarios are possible: some partners may want to reconstruct the key without the help of the other ones, and consequently collaborate with an Eve that eavesdrops on the other partners' channels. For each of these scenarios, we give the optimal individual attack that Eve can perform. A link with Bell's inequality is demonstrated analytically for half of the scenarios, and is conjectured on the basis of numerical estimates for the other scenarios: the authorized partners have a higher information on the key than the unauthorized ones if and only if they can violate a Bell's inequality.

arXiv:quant-ph/0104016•Physical Review A•Dec 12, 2001•63 citations

Semiquantum secret sharing using entangled states

Qin Li, Wai Hong Chan, Dongyang Long

Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper, we propose two semiquantum secret sharing protocols by using maximally entangled Greenberger-Horne-Zeilinger-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but one of them cannot. The presented protocols are also shown to be secure against eavesdropping.

arXiv:0906.1866•Physical Review A•Aug 4, 2010•187 citations

Secrecy extraction from no-signaling correlations

Valerio Scarani, Nicolas Gisin, Nicolas Brunner +3 more

Quantum cryptography shows that one can guarantee the secrecy of correlation on the sole basis of the laws of physics, that is, without limiting the computational power of the eavesdropper. The usual security proofs suppose that the authorized partners, Alice and Bob, have a perfect knowledge and control of their quantum systems and devices; for instance, they must be sure that the logical bits have been encoded in true qubits and not in higher dimensional systems. In this paper, we present an approach that circumvents this strong assumption. We define protocols, both for the case of bits and for generic $d$-dimensional outcomes, in which the security is guaranteed by the very structure of the Alice-Bob correlations, under the no-signaling condition. The idea is that if the correlations cannot be produced by shared randomness, then Eve has poor knowledge of Alice's and Bob's symbols. The present study assumes on the one hand that the eavesdropper Eve performs only individual attacks (this is a limitation to be removed in further work), and on the other hand that Eve can distribute any correlation compatible with the no-signaling condition (in this sense her power is greater than what quantum physics allows). Under these assumptions, we prove that the protocols defined here allow extracting secrecy from noisy correlations, when these correlations violate a Bell-type inequality by a sufficiently large amount. The region in which secrecy extraction is possible extends within the region of correlations achievable by measurements on entangled quantum states.

arXiv:quant-ph/0606197•Physical Review A•Oct 30, 2006•121 citations

N-partners Quantum Communication and Bell's inequalities

Valerio Scarani, Nicolas Gisin

We present strong evidences for the existence of a link between the security of quantum communication protocols involving N partners and the violation of some Bell's inequalities. The link allows to establish optimal eavesdropping strategies for all N; in particular, we discuss eavesdropping on quantum secret sharing (N=3). The arguments are independent of the local hidden variable debate.

•Jan 23, 2001•1 citation

Bell’s theorem with and without inequalities for the three-qubit Greenberger-Horne-Zeilinger andWstates

Adán Cabello

A proof of Bell's theorem without inequalities valid for both inequivalent classes of three-qubit entangled states under local operations assisted by classical communication, namely Greenberger-Horne-Zeilinger (GHZ) and $W,$ is described. This proof leads to a Bell inequality that allows more conclusive tests of Bell's theorem for three-qubit systems. Another Bell inequality involving both tri- and bipartite correlations is introduced which illustrates the different violations of local realism exhibited by the GHZ and $W$ states.

arXiv:quant-ph/0107146•Physical Review A•Feb 5, 2002•214 citations
In secret sharing protocols, a secret is to be distributed among several partners such that leaving out any number of them, the rest do not have the complete information. Strong multiqubit correlations in the state by which secret sharing is carried out had been proposed as a criterion for security of such protocols against individual attacks by an eavesdropper. However we show that states with weak multiqubit correlations can also be used for secure secret sharing. That our state has weak multiqubit correlations is shown from the perspective of violation of local realism, and also by showing that its higher-order correlations are described by lower ones. We then present a unified criterion for security of secret sharing in terms of violation of local realism, which works when the secret sharing state is the Greenberger-Horne-Zeilinger state (with strong multiqubit correlations), as well as states of a different class (with weak multiqubit correlations).
Quantum secret-sharing protocols involving N partners are key distribution protocols in which Alice encodes her key into $N\ensuremath{-}1$ qubits, in such a way that all the other partners must cooperate in order to retrieve the key. On these protocols, several eavesdropping scenarios are possible: some partners may want to reconstruct the key without the help of the other ones, and consequently collaborate with an Eve that eavesdrops on the other partners' channels. For each of these scenarios, we give the optimal individual attack that Eve can perform. A link with Bell's inequality is demonstrated analytically for half of the scenarios, and is conjectured on the basis of numerical estimates for the other scenarios: the authorized partners have a higher information on the key than the unauthorized ones if and only if they can violate a Bell's inequality.
Secret sharing is a procedure for sharing a secret among a number of participants such that only the qualified subsets of participants have the ability to reconstruct the secret. Even in the presence of eavesdropping, secret sharing can be achieved when all the members are quantum. So what happens if not all the members are quantum? In this paper, we propose two semiquantum secret sharing protocols by using maximally entangled Greenberger-Horne-Zeilinger-type states in which quantum Alice shares a secret with two classical parties, Bob and Charlie, in a way that both parties are sufficient to obtain the secret, but one of them cannot. The presented protocols are also shown to be secure against eavesdropping.
Quantum cryptography shows that one can guarantee the secrecy of correlation on the sole basis of the laws of physics, that is, without limiting the computational power of the eavesdropper. The usual security proofs suppose that the authorized partners, Alice and Bob, have a perfect knowledge and control of their quantum systems and devices; for instance, they must be sure that the logical bits have been encoded in true qubits and not in higher dimensional systems. In this paper, we present an approach that circumvents this strong assumption. We define protocols, both for the case of bits and for generic ddd-dimensional outcomes, in which the security is guaranteed by the very structure of the Alice-Bob correlations, under the no-signaling condition. The idea is that if the correlations cannot be produced by shared randomness, then Eve has poor knowledge of Alice's and Bob's symbols. The present study assumes on the one hand that the eavesdropper Eve performs only individual attacks (this is a limitation to be removed in further work), and on the other hand that Eve can distribute any correlation compatible with the no-signaling condition (in this sense her power is greater than what quantum physics allows). Under these assumptions, we prove that the protocols defined here allow extracting secrecy from noisy correlations, when these correlations violate a Bell-type inequality by a sufficiently large amount. The region in which secrecy extraction is possible extends within the region of correlations achievable by measurements on entangled quantum states.
A proof of Bell's theorem without inequalities valid for both inequivalent classes of three-qubit entangled states under local operations assisted by classical communication, namely Greenberger-Horne-Zeilinger (GHZ) and W,W,W, is described. This proof leads to a Bell inequality that allows more conclusive tests of Bell's theorem for three-qubit systems. Another Bell inequality involving both tri- and bipartite correlations is introduced which illustrates the different violations of local realism exhibited by the GHZ and WWW states.