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

Chinese Physics B

High-capacity three-party quantum secret sharing with superdense coding

Bin Gu, Li Chuan-Qi, Xu Fei, Yulin Chen

Published Nov 1, 2009• 35 citations
Publisher

Abstract

This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liu et al (2002 Phys. Rev. A 65 022304) and the quantum secret sharing scheme by Deng et al (2008 Phys. Lett. A 372 1957). Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstein–Podolsky–Rosen pairs in d -dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 2lb d bits of information, and almost all the pairs can be used for carrying useful information.

DOI
10.1088/1674-1056/18/11/013

Related papers

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

Fault-Tolerate Three-Party Quantum Secret Sharing over a Collective-Noise Channel

Chunyan Li, Yansong Li

We present a fault-tolerate three-party quantum secret sharing (QSS) scheme over a collective-noise channel. Decoherence-free subspaces are used to tolerate two noise modes, a collective-dephasing channel and a collective-rotating channel, respectively. In this scheme, the boss uses two physical qubits to construct a logical qubit which acts as a quantum channel to transmit one bit information to her two agents. The agents can get the information of the private key established by the boss only if they collaborate. The boss Alice encodes information with two unitary operations. Only single-photon measurements are required to rebuilt Alice's information and detect the security by the agents Bob and Charlie, not Bell-state measurements. Moreover, Almost all of the photons are used to distribute information, and its success efficiency approaches 100% in theory.

Chinese Physics Letters•Feb 1, 2011•13 citations

Three-Party Quantum Secret Sharing Based on Secure Direct Communication

Liu Yanyan, Cheng-Qian Xu

Inspired by quantum secure direct communication and quantum dense coding, we present a three-party quantum secret sharing (QSS) scheme by quantum teleportation. After performing the rectilinear basis or diagonal basis measurement randomly for the eavesdropping check to ensure the security of the quantum channel, the sender encodes the secret messages directly on a series of Einstein-Podolsky-Rosen (EPR) pairs and transmits them to the receivers by quantum teleportation. Neither of the receivers can decode the secret messages on his own even if they collaborate. Only the two receivers combine their measurement results with the sender's result, can they recover the secret messages. In this scheme, one qubit can encode two bits of classical information because quantum dense coding is introduced. Using quantum teleportation, the distinct advantage of this scheme is that there is not the transmission of qubits carrying the secret messages in the quantum channel, it is absolutely secure for QSS if a perfect channel is used.

International Forum on Information Technology and Applications•May 1, 2009•8 citations

Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding*

Hong Lai, Ming-Xing 明星 Luo 罗, Josef Pieprzyk +3 more

Abstract In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value.

Communications in Theoretical Physics•Nov 1, 2016•5 citations

High-dimension multiparty quantum secret sharing scheme with Einstein–Podolsky–Rosen pairs

Chen Pan, Deng Fu-Guo, Long Gui-Lu

In this paper a high-dimension multiparty quantum secret sharing scheme is proposed by using Einstein–Podolsky–Rosen pairs and local unitary operators. This scheme has the advantage of not only having higher capacity, but also saving storage space. The security analysis is also given.

Chinese Physics•Sep 21, 2006•49 citations

An Efficient Quantum Secret Sharing Scheme Based on Bell States

Fen-Zhuo Guo, Gao Fei

Drawing idea from the quantum secure direct communication(QSDC),a novel quantum secret sharing(QSS) scheme with high efficiency based on Bell states was proposed.In this scheme,the sender Alice needed no longer share a joint key between her and the two receivers,Bob and Charlie,as well as used the joint key to transmit her message.Alice shared her secret message with Bob and Charlie directly.One Bell state could be used to share two bits message.Investigation showed that the scheme is secure.

Beijing Youdian Xueyuan xuebao•Jan 1, 2005•0 citations
This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liu et al (2002 Phys. Rev. A 65 022304) and the quantum secret sharing scheme by Deng et al (2008 Phys. Lett. A 372 1957). Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstein–Podolsky–Rosen pairs in d -dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 2lb d bits of information, and almost all the pairs can be used for carrying useful information.
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.
We present a fault-tolerate three-party quantum secret sharing (QSS) scheme over a collective-noise channel. Decoherence-free subspaces are used to tolerate two noise modes, a collective-dephasing channel and a collective-rotating channel, respectively. In this scheme, the boss uses two physical qubits to construct a logical qubit which acts as a quantum channel to transmit one bit information to her two agents. The agents can get the information of the private key established by the boss only if they collaborate. The boss Alice encodes information with two unitary operations. Only single-photon measurements are required to rebuilt Alice's information and detect the security by the agents Bob and Charlie, not Bell-state measurements. Moreover, Almost all of the photons are used to distribute information, and its success efficiency approaches 100% in theory.
Inspired by quantum secure direct communication and quantum dense coding, we present a three-party quantum secret sharing (QSS) scheme by quantum teleportation. After performing the rectilinear basis or diagonal basis measurement randomly for the eavesdropping check to ensure the security of the quantum channel, the sender encodes the secret messages directly on a series of Einstein-Podolsky-Rosen (EPR) pairs and transmits them to the receivers by quantum teleportation. Neither of the receivers can decode the secret messages on his own even if they collaborate. Only the two receivers combine their measurement results with the sender's result, can they recover the secret messages. In this scheme, one qubit can encode two bits of classical information because quantum dense coding is introduced. Using quantum teleportation, the distinct advantage of this scheme is that there is not the transmission of qubits carrying the secret messages in the quantum channel, it is absolutely secure for QSS if a perfect channel is used.
Abstract In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value.