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

Secret sharing without monitoring signal disturbance

Kejin Wei, Xiuqing Yang, Haiqiang Ma, Zhu, Changhua

Published Dec 31, 2016• 1 citation
arXivHTMLPDF

Abstract

Secret sharing, in which a dealer wants to split a secret in such a way that any unauthorized subset of parties is unable to reconstruct it, plays a key role in cryptography. The security of quantum protocols for the task is guaranteed by the fact that Eve's any strategies to obtain secret information from encoded quantum states should cause a disturbance in the signal. Here, we propose a quantum secret sharing (classical information) scheme for $N$ parties based on totally different principle in which monitoring signal disturbance is no longer need. In this scheme, the secret is divided among several partners by sequential transmissions of a $L$-dimensional qudit state, which can be practically implemented using a conventional laser and some standard off-the-shelf components. Our scheme paves a novel and practical way for quantum secret sharing.

DOI
10.48550/arxiv.1701.00059

Related papers

Secure quantum secret sharing without signal disturbance monitoring

Jie Gu, Yuan-Mei Xie, Wen‐Bo Liu +3 more

Quantum secret sharing (QSS) is an essential primitive for the future quantum internet, which promises secure multiparty communication. However, developing a large-scale QSS network is a huge challenge due to the channel loss and the requirement of multiphoton interference or high-fidelity multipartite entanglement distribution. Here, we propose a three-user QSS protocol without monitoring signal disturbance, which is capable of ensuring the unconditional security. The final key rate of our protocol can be demonstrated to break the Pirandola-Laurenza-Ottaviani-Banchi bound of quantum channel and its simulated transmission distance can approach over 600 km using current techniques. Our results pave the way to realizing high-rate and large-scale QSS networks.

arXiv:2104.10321•Optics Express•Sep 16, 2021•46 citations

Quantum secret sharing using GHZ state qubit positioning and selective qubits strategy for secret reconstruction

Farhan Musanna, Sanjeev Kumar

The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other parties make their Bell measurements and collude to reconstruct the secret. Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the time of reconstruction to decrypt the secret. The protocol also allows for security against malicious attacks by an adversary without affecting the integrity of the secret. The security of the protocol lies in the fact that each party's correct announcement of their measurement is required for reconstruction, failing which the reconstruction process is jeopardized, thereby ascertaining the $(3,3)$ scheme which can further be extended for a $(n,n)$ scheme.

arXiv:2002.09182•Feb 21, 2020•1 citation

Secret sharing with a single d -level quantum system

Armin Tavakoli, Isabelle Herbauts, Marek Żukowski +1 more

We give an example of a wide class of problems for which quantum-information protocols based on multisystem entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a classical message is divided into shares given to recipient parties in such a way that some number of parties need to collaborate in order to reconstruct the message. Quantum protocols for the task commonly rely on multipartite GHZ entanglement. We present a multiparty secret sharing protocol which requires only sequential communication of a single quantum $d$-level system (for any prime $d$). It has huge advantages in scalability and can be realized with state-of-the-art technology.

arXiv:1501.05582•Physical Review A•Sep 21, 2015•142 citations

Practical quantum key distribution protocol without monitoring signal disturbance

Sasaki Toshihiko, Y. Yamamoto, Koashi Masato

Quantum cryptograph exploits the fundamental laws of quantum mechanics to provide a secure way to exchange private information. Such an exchange requires a common random bit sequence, called a key, to be shared secretly between the sender and the receiver. The basic idea behind quantum key distribution (QKD) has widely been understood as the property that any attempt to distinguish encoded quantum states causes a disturbance in the signal. As a result, implementation of a QKD protocol involves an estimation of the experimental parameters influenced by the eavesdropper’s intervention, which is achieved by randomly sampling the signal. If the estimation of many parameters with high precision is required, the portion of the signal that is sacrificed increases, thus decreasing the efficiency of the protocol. Here we propose a QKD protocol based on an entirely different principle. The sender encodes a bit sequence onto non-orthogonal quantum states and the receiver randomly dictates how a single bit should be calculated from the sequence. The eavesdropper, who is unable to learn the whole of the sequence, cannot guess the bit value correctly. An achievable rate of secure key distribution is calculated by considering complementary choices between quantum measurements of two conjugate observables. We found that a practical implementation using a laser pulse train achieves a key rate comparable to a decoy-state QKD protocol, an often-used technique for lasers. It also has a better tolerance of bit errors and of finite-sized-key effects. We anticipate that this finding will give new insight into how the probabilistic nature of quantum mechanics can be related to secure communication, and will facilitate the simple and efficient use of conventional lasers for QKD.

•May 22, 2014•0 citations

Unconditional Security of Entanglement-Based Quantum Secret Sharing Schemes

Ioannis Kogias, X. D. Yu, 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 against eavesdroppers and dishonest participants remained unproven. Here we establish an unconditional security proof for continuous variable entanglement-based quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players, by utilizing ideas from the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate the practical 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 establish quantum secret sharing as a viable and practically relevant primitive for quantum communication technologies.

•Mar 10, 2016•0 citations

Quantum key distribution with coherent laser pulse train: Security without monitoring disturbance

Masato Koashi

Conventional quantum key distribution (QKD) schemes determine the amount of leaked information through estimation of signal disturbance. Here we present a QKD protocol based on an entirely different principle, which works without monitoring the disturbance. The protocol is implemented with a laser, an interferometer with a variable delay, and photon detectors. It is capable of producing a secret key when the bit error rate is high and the communication time is short.

Photonics North (PN)•Jun 1, 2015•0 citations
Secret sharing, in which a dealer wants to split a secret in such a way that any unauthorized subset of parties is unable to reconstruct it, plays a key role in cryptography. The security of quantum protocols for the task is guaranteed by the fact that Eve's any strategies to obtain secret information from encoded quantum states should cause a disturbance in the signal. Here, we propose a quantum secret sharing (classical information) scheme for NNN parties based on totally different principle in which monitoring signal disturbance is no longer need. In this scheme, the secret is divided among several partners by sequential transmissions of a LLL-dimensional qudit state, which can be practically implemented using a conventional laser and some standard off-the-shelf components. Our scheme paves a novel and practical way for quantum secret sharing.
Quantum secret sharing (QSS) is an essential primitive for the future quantum internet, which promises secure multiparty communication. However, developing a large-scale QSS network is a huge challenge due to the channel loss and the requirement of multiphoton interference or high-fidelity multipartite entanglement distribution. Here, we propose a three-user QSS protocol without monitoring signal disturbance, which is capable of ensuring the unconditional security. The final key rate of our protocol can be demonstrated to break the Pirandola-Laurenza-Ottaviani-Banchi bound of quantum channel and its simulated transmission distance can approach over 600 km using current techniques. Our results pave the way to realizing high-rate and large-scale QSS networks.
The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other parties make their Bell measurements and collude to reconstruct the secret. Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the time of reconstruction to decrypt the secret. The protocol also allows for security against malicious attacks by an adversary without affecting the integrity of the secret. The security of the protocol lies in the fact that each party's correct announcement of their measurement is required for reconstruction, failing which the reconstruction process is jeopardized, thereby ascertaining the (3,3)(3,3)(3,3) scheme which can further be extended for a (n,n)(n,n)(n,n) scheme.
We give an example of a wide class of problems for which quantum-information protocols based on multisystem entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a classical message is divided into shares given to recipient parties in such a way that some number of parties need to collaborate in order to reconstruct the message. Quantum protocols for the task commonly rely on multipartite GHZ entanglement. We present a multiparty secret sharing protocol which requires only sequential communication of a single quantum ddd-level system (for any prime ddd). It has huge advantages in scalability and can be realized with state-of-the-art technology.
Quantum cryptograph exploits the fundamental laws of quantum mechanics to provide a secure way to exchange private information. Such an exchange requires a common random bit sequence, called a key, to be shared secretly between the sender and the receiver. The basic idea behind quantum key distribution (QKD) has widely been understood as the property that any attempt to distinguish encoded quantum states causes a disturbance in the signal. As a result, implementation of a QKD protocol involves an estimation of the experimental parameters influenced by the eavesdropper’s intervention, which is achieved by randomly sampling the signal. If the estimation of many parameters with high precision is required, the portion of the signal that is sacrificed increases, thus decreasing the efficiency of the protocol. Here we propose a QKD protocol based on an entirely different principle. The sender encodes a bit sequence onto non-orthogonal quantum states and the receiver randomly dictates how a single bit should be calculated from the sequence. The eavesdropper, who is unable to learn the whole of the sequence, cannot guess the bit value correctly. An achievable rate of secure key distribution is calculated by considering complementary choices between quantum measurements of two conjugate observables. We found that a practical implementation using a laser pulse train achieves a key rate comparable to a decoy-state QKD protocol, an often-used technique for lasers. It also has a better tolerance of bit errors and of finite-sized-key effects. We anticipate that this finding will give new insight into how the probabilistic nature of quantum mechanics can be related to secure communication, and will facilitate the simple and efficient use of conventional lasers for QKD.
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 against eavesdroppers and dishonest participants remained unproven. Here we establish an unconditional security proof for continuous variable entanglement-based quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players, by utilizing ideas from the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate the practical 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 establish quantum secret sharing as a viable and practically relevant primitive for quantum communication technologies.