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:1510.05044

Device-independent quantum secret sharing using Mermin-type contextuality

Stefano Gogioso

Published Oct 16, 2015• 2 citations
arXivHTMLPDF

Abstract

We present a new quantum secret sharing protocol based on recent advances in Mermin-type contextuality scenarios, which has some security guarantees against postquantum nonsignaling attackers. It is a fundamental assumption of secret sharing protocols that not all players are trusted parties, and that some may collude amongst themselves and with eavesdroppers to break confidentiality. To this extent, quantum secret sharing introduces a new layer of security, enabling eavesdropping detection via entangled states and noncommuting observables. A more thorough security analysis, however, becomes crucial if the protocol relies on untrusted devices for its implementation: for example, it cannot be excluded that some players may collude with the device supplier. In this paper, we put recent developments in Mermin-type contextuality to work in a new quantum secret sharing protocol. The maximal contextuality (aka maximal non-locality, or zero local fraction) demonstrated by the measurement scenarios results in some device-independent security guarantees against nonsignaling attackers -- be they classical, quantum or postquantum.

DOI
10.48550/arxiv.1510.05044

Related papers

Vulnerabilities and Attacks on Quantum Secret Sharing (QSS) Schemes: A Review

Ajay Kumar, Mukesh Sharma

Quantum secret sharing (QSS) allows a dealer to split a secret among several players so that only authorized coalitions can recover it, while any eavesdropping is revealed by quantum disturbance. Since the first proposals in 1999 [3–5], a long series of cryptanalyses has shown that many QSS protocols fail not because of outside eavesdroppers but because of their own players. In this paper, we review the flaws in and attacks on QSS from 1999 to 2026. We classify the attacks into three layers: protocol-level attacks (intercept-resend, entangle-measure, Trojan horse and fake-signal); insider attacks by dishonest or colluding participants, which are especially powerful because insiders control part of the security check; and implementation-level (side-channel) attacks, which exploit imperfect sources, detectors and local oscillators. For each class, we describe the attack mechanism, representative protocols that were broken, and the countermeasures that followed, such as decoy states, one-way transmission with wavelength filtering, measurement-device-independent (MDI) and device-independent (DI) QSS, and composable finite-key proofs that treat dishonest players as adversaries. We conclude that the field is converging on a single lesson: a QSS protocol is only as secure as the participant model behind its proof, so security proofs must treat every player as a potential adversary with full access to their own devices. We end with open problems for QSS in quantum networks.

International Journal For Multidisciplinary Research•Nov 8, 2026•0 citations

Device Independent Quantum Secret Sharing Using Multiparty Pseudo-telepathy Game

Santanu Majhi, Goutam Paul

Device-independent quantum secret sharing (DI-QSS) provides security against untrusted quantum devices. While device-independent quantum key distribution (DI-QKD) using Mermin-Peres magic square game [Zhen et al., Phys. Rev. Lett, 2023] has been proposed, we present the first DI-QSS protocol based on a pseudo-telepathy parity game without requiring dedicated rounds and specific basis configuration, unlike CHSH-based DI-QSS schemes [Zhang et al., Phys. Rev. A, 2024]. Our scheme simultaneously certifies device-independence and key generation using a single test, achieving optimal performance for a seven-qubit GHZ state configuration. Security against collective attacks is analyzed, and a positive key rate is obtained under white noise and photon loss. Moreover, we show a bitwise advantage over the previous protocol for producing the same raw key length.

quant-pharXiv:2512.09699•Dec 11, 2025•1 citation

Device-independent quantum secret sharing with advanced random key generation basis

Qi Zhang, Jia‐Wei Ying, Wang Zhong-jian +9 more

Quantum secret sharing (QSS) enables a dealer to securely distribute keys to multiple players. Device-independent (DI) QSS can resist all possible attacks from practical imperfect devices and provide QSS the highest level of security in theory. However, DI QSS requires high-performance devices, especially for low-noise channels, which is a big challenge to demonstrate experimentally. We propose a DI QSS protocol with the advanced random key generation basis strategy, which combines the random key generation basis with the noise preprocessing and postselection strategies. We develop the methods to numerically simulate the key generation rate in an acceptable time. Our DI QSS protocol has some advantages. First, it can increase the noise tolerance threshold from an initial 7.147% to 9.231% (29.16% growth) and reduce the global detection efficiency threshold from 96.32% to 93.41%. The maximal distance between any two users increases to 1.43 km, which is about 5.5 times the initial value. Second, by randomly selecting two basis combinations to generate the key, our DI QSS protocol can reduce the entanglement resource consumption. Our protocol has potential for the experimental demonstration of DI QSS and application in the future.

arXiv:2410.04003•Physical Review A•Jan 2, 2025•49 citations

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

Ioannis Kogias, Yu Xiang, Qiongyi He +1 more

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 proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.

arXiv:1603.03224•Physical Review A•Jan 12, 2017•200 citations

A novel approach for secure multi-party secret sharing scheme via Quantum cryptography

Noor ul Ain

Classical secret sharing proposed by Shamir used classical computational power in classical cryptography to achieve secret key sharing, but with the advent of quantum systems, computational power can be overruled. To ensure a secure secret sharing scheme independent of computational power, a scheme independent of computational complexity is needed to achieve security. This paper will provide a protocol dependent on inherent secure nature of quantum cryptography (quantum no cloning theorem and quantum measurement rule). A secure multiparty quantum secret sharing scheme has been proposed to ensure that no one can eavesdrop or extract any share of the secret message via inherent security provided by quantum entanglement swapping and quantum teleportation. Entanglement swapping is a process that allows two non-interacting quantum systems to be entangled. Whereas, Quantum teleportation allows a party to send a qubit to another entangled party without sending the qubit over the channel. Moreover, in order to ensure security against possible active attacks, sender himself will generate and distribute EPR pairs to be used in the scheme. Result will be a secure multiparty QSS scheme which will be secure against internal and external eavesdropping, masquerading and brute-force attacks.

International Conference on Communication, Computing and Digital Systems (C-CODE)•Mar 1, 2017•12 citations

Device-independent secret sharing and a stronger form of Bell nonlocality

George Moreno, Samuraí Brito, Ranieri Nery +1 more

Bell nonlocality, the fact that local hidden-variable models cannot reproduce the correlations obtained by measurements on entangled states, is a cornerstone in our modern understanding of quantum theory. Apart from its fundamental implications, nonlocality is also at the core of device-independent quantum information processing, the successful implementation of which is achieved without precise knowledge of the physical apparatus. Here we show that a stronger form of Bell nonlocality, for which even some nonlocal hidden-variable models cannot reproduce the quantum predictions, allows us to circumvent possible attacks in the implementation of secret sharing, a paradigmatic communication protocol in which a secret split amid many possibly untrusted parts can be decoded only if they collaborate among themselves.

arXiv:1909.11785•Physical Review A•May 27, 2020•43 citations
We present a new quantum secret sharing protocol based on recent advances in Mermin-type contextuality scenarios, which has some security guarantees against postquantum nonsignaling attackers. It is a fundamental assumption of secret sharing protocols that not all players are trusted parties, and that some may collude amongst themselves and with eavesdroppers to break confidentiality. To this extent, quantum secret sharing introduces a new layer of security, enabling eavesdropping detection via entangled states and noncommuting observables. A more thorough security analysis, however, becomes crucial if the protocol relies on untrusted devices for its implementation: for example, it cannot be excluded that some players may collude with the device supplier. In this paper, we put recent developments in Mermin-type contextuality to work in a new quantum secret sharing protocol. The maximal contextuality (aka maximal non-locality, or zero local fraction) demonstrated by the measurement scenarios results in some device-independent security guarantees against nonsignaling attackers -- be they classical, quantum or postquantum.
Quantum secret sharing (QSS) allows a dealer to split a secret among several players so that only authorized coalitions can recover it, while any eavesdropping is revealed by quantum disturbance. Since the first proposals in 1999 [3–5], a long series of cryptanalyses has shown that many QSS protocols fail not because of outside eavesdroppers but because of their own players. In this paper, we review the flaws in and attacks on QSS from 1999 to 2026. We classify the attacks into three layers: protocol-level attacks (intercept-resend, entangle-measure, Trojan horse and fake-signal); insider attacks by dishonest or colluding participants, which are especially powerful because insiders control part of the security check; and implementation-level (side-channel) attacks, which exploit imperfect sources, detectors and local oscillators. For each class, we describe the attack mechanism, representative protocols that were broken, and the countermeasures that followed, such as decoy states, one-way transmission with wavelength filtering, measurement-device-independent (MDI) and device-independent (DI) QSS, and composable finite-key proofs that treat dishonest players as adversaries. We conclude that the field is converging on a single lesson: a QSS protocol is only as secure as the participant model behind its proof, so security proofs must treat every player as a potential adversary with full access to their own devices. We end with open problems for QSS in quantum networks.
Device-independent quantum secret sharing (DI-QSS) provides security against untrusted quantum devices. While device-independent quantum key distribution (DI-QKD) using Mermin-Peres magic square game [Zhen et al., Phys. Rev. Lett, 2023] has been proposed, we present the first DI-QSS protocol based on a pseudo-telepathy parity game without requiring dedicated rounds and specific basis configuration, unlike CHSH-based DI-QSS schemes [Zhang et al., Phys. Rev. A, 2024]. Our scheme simultaneously certifies device-independence and key generation using a single test, achieving optimal performance for a seven-qubit GHZ state configuration. Security against collective attacks is analyzed, and a positive key rate is obtained under white noise and photon loss. Moreover, we show a bitwise advantage over the previous protocol for producing the same raw key length.
Quantum secret sharing (QSS) enables a dealer to securely distribute keys to multiple players. Device-independent (DI) QSS can resist all possible attacks from practical imperfect devices and provide QSS the highest level of security in theory. However, DI QSS requires high-performance devices, especially for low-noise channels, which is a big challenge to demonstrate experimentally. We propose a DI QSS protocol with the advanced random key generation basis strategy, which combines the random key generation basis with the noise preprocessing and postselection strategies. We develop the methods to numerically simulate the key generation rate in an acceptable time. Our DI QSS protocol has some advantages. First, it can increase the noise tolerance threshold from an initial 7.147% to 9.231% (29.16% growth) and reduce the global detection efficiency threshold from 96.32% to 93.41%. The maximal distance between any two users increases to 1.43 km, which is about 5.5 times the initial value. Second, by randomly selecting two basis combinations to generate the key, our DI QSS protocol can reduce the entanglement resource consumption. Our protocol has potential for the experimental demonstration of DI QSS and application in the future.
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 proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.
Classical secret sharing proposed by Shamir used classical computational power in classical cryptography to achieve secret key sharing, but with the advent of quantum systems, computational power can be overruled. To ensure a secure secret sharing scheme independent of computational power, a scheme independent of computational complexity is needed to achieve security. This paper will provide a protocol dependent on inherent secure nature of quantum cryptography (quantum no cloning theorem and quantum measurement rule). A secure multiparty quantum secret sharing scheme has been proposed to ensure that no one can eavesdrop or extract any share of the secret message via inherent security provided by quantum entanglement swapping and quantum teleportation. Entanglement swapping is a process that allows two non-interacting quantum systems to be entangled. Whereas, Quantum teleportation allows a party to send a qubit to another entangled party without sending the qubit over the channel. Moreover, in order to ensure security against possible active attacks, sender himself will generate and distribute EPR pairs to be used in the scheme. Result will be a secure multiparty QSS scheme which will be secure against internal and external eavesdropping, masquerading and brute-force attacks.
Bell nonlocality, the fact that local hidden-variable models cannot reproduce the correlations obtained by measurements on entangled states, is a cornerstone in our modern understanding of quantum theory. Apart from its fundamental implications, nonlocality is also at the core of device-independent quantum information processing, the successful implementation of which is achieved without precise knowledge of the physical apparatus. Here we show that a stronger form of Bell nonlocality, for which even some nonlocal hidden-variable models cannot reproduce the quantum predictions, allows us to circumvent possible attacks in the implementation of secret sharing, a paradigmatic communication protocol in which a secret split amid many possibly untrusted parts can be decoded only if they collaborate among themselves.