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

Workshop on Knowledge Discovery and Data Mining

Quantum Secret Sharing Based on Entanglement without Local Unitary Operations

Yunyan Yang, Guisheng Yin, Tingquan Deng

Published Jan 1, 2009• 0 citations
Publisher

Abstract

This paper proposes a three-party quantum secret sharing scheme based on entanglement without local unitary operations. The message sender prepares the entangled states and sends them to the agents, who can obtain the secret message by only performing measurement on their photons if all of the agents collaborate. In contrast to the use of local unitary operations in most of other schemes, our scheme is more convenient for the information receivers.

DOI
10.1109/wkdd.2009.106

Related papers

Advanced Multiparty Quantum Secret Sharing using Entanglement Swapping

N.T.V. Luu, S. Shimamoto

A multiparty quantum secret sharing scheme is proposed to utilize the magic properties of entanglement swapping. In this scheme, a set of (2N-1) EPR pairs is used to encode and distribute a secret message to (N-1) parties. Each secret message will be split into (N-1) packets. By performing the local unitary operations and entanglement swapping, each classical bit packet will be encoded secretly into Bell states so no subset of parties but their entire cooperation can read out the original secret message. The security of this proposed scheme is also considered.

•Oct 24, 2006•1 citation

Quantum Secret Sharing Based on Entanglement Swapping and Local Operation

Qin Su-juan, Tailin Liu, Wen Qiao-yan

To improve the efficiency of quantum secret sharing, a protocol share the message directly among the users was proposed. The scheme made full use of entanglement swapping of Bell states and local operations. For detection of eavesdropping, the EPR pairs were divided into two parts: the checking parts and the encoding parts. After insuring the security of the quantum channel by measuring the checking particles in conjugate bases, the sender encoded her bits via the local unitary operations on the encoding parts. Investigation shows that the protocol is secure and two Bell states can be used to share two bits message.

Beijing Youdian Xueyuan xuebao•Jan 1, 2005•2 citations

Three-partyd-level quantum secret sharing protocol

Dong Pyo Chi, Jeong Woon Choi, Jeong San Kim +2 more

We develop a three-party quantum secret sharing protocol based on arbitrary dimensional quantum states. In contrast to the previous quantum secret sharing protocols, the sender can always control the state, just using local operations, for adjusting the correlation of measurement directions of three parties and thus there is no waste of resource due to the discord between the directions. Moreover, our protocol contains the hidden value which enables the sender to leak no information of secret key to the dishonest receiver until the last steps of the procedure.

arXiv:0801.0177•Journal of Physics A Mathematical and Theoretical•Jun 5, 2008•6 citations

Efficient Three-Party Quantum Secret Sharing with Single Photons

Ping Zhou, Xihan Li, Deng Fu-Guo +1 more

A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett–Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.

Chinese Physics Letters•Jul 26, 2007•26 citations

New quantum secret sharing protocol based on entanglement swapping

Dan Liu

The insecurity of the protocols for quantum secret sharing(QSS) based on entanglement swapping was analyzed,and a new method of QSS based on entanglement swapping was proposed.The entanglement states were all generated by the sender,and the order of two photons sent to the same agent was randomly changed.After the photons arrived at the receiver,for the detection mode,the order of the two photons was announced,so that the two parties detected the security of the quantum channel;for the information mode,the two receivers respectively did Bell measurement on the two photons they owned,and then communicated through classical channel to share the secret key with the sender.Analysis results show that this protocol not only ensures the validity and security of the shared information,but also only uses the entanglement states of two photons without unitary operation.

Journal of Optoelectronics·laser•Jan 1, 2011•2 citations

Improved quantum secret sharing based on entanglement swapping

Mahsa Khorrampanah, Monireh Houshmand, Ali Karimi-lenji

Using entanglement swapping, a quantum secret sharing protocol is proposed. After sharing three-EPR among users, for encoding the message, the sender prepares an auxiliary EPR pair and by operating defined Pauli operations, she transmits six-bit message to her two agents. Since using entanglement swapping, no qubits carrying message are transmitted. So, if the perfect quantum channel is used, the protocol is unconditional secure. In addition, this protocol enhances the efficiency of Zhang-Man and Chou et al. protocols and with the comparison of previous works has better performance.

Iranian Conference on Electrical Engineering•May 18, 2021•3 citations
This paper proposes a three-party quantum secret sharing scheme based on entanglement without local unitary operations. The message sender prepares the entangled states and sends them to the agents, who can obtain the secret message by only performing measurement on their photons if all of the agents collaborate. In contrast to the use of local unitary operations in most of other schemes, our scheme is more convenient for the information receivers.
A multiparty quantum secret sharing scheme is proposed to utilize the magic properties of entanglement swapping. In this scheme, a set of (2N-1) EPR pairs is used to encode and distribute a secret message to (N-1) parties. Each secret message will be split into (N-1) packets. By performing the local unitary operations and entanglement swapping, each classical bit packet will be encoded secretly into Bell states so no subset of parties but their entire cooperation can read out the original secret message. The security of this proposed scheme is also considered.
To improve the efficiency of quantum secret sharing, a protocol share the message directly among the users was proposed. The scheme made full use of entanglement swapping of Bell states and local operations. For detection of eavesdropping, the EPR pairs were divided into two parts: the checking parts and the encoding parts. After insuring the security of the quantum channel by measuring the checking particles in conjugate bases, the sender encoded her bits via the local unitary operations on the encoding parts. Investigation shows that the protocol is secure and two Bell states can be used to share two bits message.
We develop a three-party quantum secret sharing protocol based on arbitrary dimensional quantum states. In contrast to the previous quantum secret sharing protocols, the sender can always control the state, just using local operations, for adjusting the correlation of measurement directions of three parties and thus there is no waste of resource due to the discord between the directions. Moreover, our protocol contains the hidden value which enables the sender to leak no information of secret key to the dishonest receiver until the last steps of the procedure.
A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett–Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.
The insecurity of the protocols for quantum secret sharing(QSS) based on entanglement swapping was analyzed,and a new method of QSS based on entanglement swapping was proposed.The entanglement states were all generated by the sender,and the order of two photons sent to the same agent was randomly changed.After the photons arrived at the receiver,for the detection mode,the order of the two photons was announced,so that the two parties detected the security of the quantum channel;for the information mode,the two receivers respectively did Bell measurement on the two photons they owned,and then communicated through classical channel to share the secret key with the sender.Analysis results show that this protocol not only ensures the validity and security of the shared information,but also only uses the entanglement states of two photons without unitary operation.
Using entanglement swapping, a quantum secret sharing protocol is proposed. After sharing three-EPR among users, for encoding the message, the sender prepares an auxiliary EPR pair and by operating defined Pauli operations, she transmits six-bit message to her two agents. Since using entanglement swapping, no qubits carrying message are transmitted. So, if the perfect quantum channel is used, the protocol is unconditional secure. In addition, this protocol enhances the efficiency of Zhang-Man and Chou et al. protocols and with the comparison of previous works has better performance.