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:1501.05582 · Physical Review A

Secret sharing with a single d -level quantum system

Armin Tavakoli, Isabelle Herbauts, Marek Żukowski, Mohamed Bourennane

Published Sep 21, 2015• 144 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.92.030302

Related papers

Experimental Single Qubit Quantum Secret Sharing

Christian Schmid, Pavel Trojek, Mohamed Bourennane +3 more

We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its proof-of-principle experimental realization. In this protocol, a secret is split among several parties in a way that its reconstruction requires the collaboration of the participating parties. In our scheme the parties solve the problem by sequential transformations on a single qubit. In contrast with recently proposed schemes involving multiparticle Greenberger-Horne-Zeilinger states, the approach demonstrated here is much easier to realize and scalable in practical applications.

arXiv:quant-ph/0502107•Physical Review Letters•Dec 1, 2005•229 citations

Experimental quantum secret sharing

Ch. Schmid, Pavel Trojek, Sascha Gaertner +4 more

Abstract We consider two simple and practical protocols for multiparty communication and show their experimental realization. These protocols deal with the task of secret sharing in which a secret message is split among several parties in a way that its reconstruction requires their mutual collaboration. In the presented schemes the parties solve the problem by two different approaches: The first uses as a resource the multiqubit entangled state |Π4‐〉. As no interferometric setups are required here, contrary to known schemes, involving Greenberger‐Horne‐Zeilinger states, its implementation is simpler and more stable. In the second scheme only sequential transformations on a single qubit are used. This further tremendously simplifies the method, makes it scalable with regard to the number of participating partners and above all, technologically comparable to quantum key distribution.

Fortschritte der Physik•Aug 1, 2006•15 citations

Multiparty quantum secret sharing

Zhanjun Zhang, Yong Li, Zhong‐Xiao Man

Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A 69 052319 (2004)], we propose a $(n,n)$-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information receivers collaborate can the original qubit be reconstructed. A general idea is also proposed for constructing multiparty SSQI schemes from any QSSCM scheme.

arXiv:quant-ph/0412203•Physical Review A•Apr 11, 2005•476 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

Quantum secret sharing between multiparty and multiparty without entanglement

Fengli Yan, Ting Gao

We propose a quantum secret sharing protocol between multiparty ($m$ members in group 1) and multiparty ($n$ members in group 2) using a sequence of single photons. These single photons are used directly to encode classical information in a quantum secret sharing process. In this protocol, all members in group 1 directly encode their respective keys on the states of single photons via unitary operations; then, the last one (the $m\mathrm{th}$ member of group 1) sends $1∕n$ of the resulting qubits to each of group 2. Thus the secret message shared by all members of group 1 is shared by all members of group 2 in such a way that no subset of each group is efficient to read the secret message, but the entire set (not only group 1 but also group 2) is. We also show that it is unconditionally secure. This protocol is feasible with present-day techniques.

arXiv:quant-ph/0502045•Physical Review A•Jul 7, 2005•233 citations

Cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled state

Shuang Li, Xiao‐Qiu Cai, Shaorui Song +2 more

Quantum secret sharing is a basic quantum cryptographic primitive, which plays an important role in robust key management and secure multiparty computation etc. In this work, we give a cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled states proposed recently, which shows that the controller can recover the secret if he cooperates with any one participant. Furthermore, an external opponent can make participants recover a false secret without being detected by a special denial-of-service attack. Therefore, this protocol does not satisfy the security requirement that any unauthorized set can gain access to no information on the secret and cannot guarantee its correctness.

Scientific Reports•Apr 29, 2025•2 citations
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.
We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its proof-of-principle experimental realization. In this protocol, a secret is split among several parties in a way that its reconstruction requires the collaboration of the participating parties. In our scheme the parties solve the problem by sequential transformations on a single qubit. In contrast with recently proposed schemes involving multiparticle Greenberger-Horne-Zeilinger states, the approach demonstrated here is much easier to realize and scalable in practical applications.
Abstract We consider two simple and practical protocols for multiparty communication and show their experimental realization. These protocols deal with the task of secret sharing in which a secret message is split among several parties in a way that its reconstruction requires their mutual collaboration. In the presented schemes the parties solve the problem by two different approaches: The first uses as a resource the multiqubit entangled state |Π4‐〉. As no interferometric setups are required here, contrary to known schemes, involving Greenberger‐Horne‐Zeilinger states, its implementation is simpler and more stable. In the second scheme only sequential transformations on a single qubit are used. This further tremendously simplifies the method, makes it scalable with regard to the number of participating partners and above all, technologically comparable to quantum key distribution.
Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A 69 052319 (2004)], we propose a (n,n)(n,n)(n,n)-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information receivers collaborate can the original qubit be reconstructed. A general idea is also proposed for constructing multiparty SSQI schemes from any QSSCM scheme.
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.
We propose a quantum secret sharing protocol between multiparty (mmm members in group 1) and multiparty (nnn members in group 2) using a sequence of single photons. These single photons are used directly to encode classical information in a quantum secret sharing process. In this protocol, all members in group 1 directly encode their respective keys on the states of single photons via unitary operations; then, the last one (the mthm\mathrm{th}mth member of group 1) sends 1∕n1∕n1∕n of the resulting qubits to each of group 2. Thus the secret message shared by all members of group 1 is shared by all members of group 2 in such a way that no subset of each group is efficient to read the secret message, but the entire set (not only group 1 but also group 2) is. We also show that it is unconditionally secure. This protocol is feasible with present-day techniques.
Quantum secret sharing is a basic quantum cryptographic primitive, which plays an important role in robust key management and secure multiparty computation etc. In this work, we give a cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled states proposed recently, which shows that the controller can recover the secret if he cooperates with any one participant. Furthermore, an external opponent can make participants recover a false secret without being detected by a special denial-of-service attack. Therefore, this protocol does not satisfy the security requirement that any unauthorized set can gain access to no information on the secret and cannot guarantee its correctness.