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:quant-ph/0603145 · Journal of the Korean Physical Society

Multipartite Quantum Secret Sharing Using Not-So-Weak Qubits

Yun Jin Choi, Young-Jai Park, Chil-Min Kim

Published Jul 14, 2007• 0 citations
arXivHTMLPDF

Abstract

We propose a new quantum secret sharing scheme using a single non-entangled qubit. In the scheme, by transmitting a qubit to the next party sequentially, a sender can securely transmit a secret message to $N$ receivers who could only decode the message cooperatively after randomly shuffling the polarization of the qubit. We explain this quantum secret sharing scheme into the one between a sender and two receivers, and generalize the scheme between a sender and $N$ receivers. Since our scheme is capable of using a faint coherent pulse as a qubit, it is experimentally feasible within current technology.

DOI
10.3938/jkps.51.4

Related papers

Multiparty Quantum Secret Sharing of Key Using Practical Faint Laser Pulses

张战军, 满忠晓

Based on a bidirectional quantum key distribution protocol [Phys. Rev. A 70 (2004)012311], we propose a (m-1, m-1)-threshold scheme of m (m≥3)-party quantum secret sharing of key by using practical faint laser pulses. In our scheme, if all the m-1 sharers collaborate, they can obtain the joint secret key from the message sender. Our scheme is more feasible according to the present-day technology.

Chinese Physics Letters•Jan 1, 2005•0 citations

Multiparty Quantum Secret Sharing of Key Using Practical Faint Laser Pulses

Zhanjun Zhang, Man Zhong-Xiao

Based on a bidirectional quantum key distribution protocol [Phys. Rev. A 70 (2004) 012311], we propose a ( m −1, m −1)-threshold scheme of m ( m ⩾ 3)-party quantum secret sharing of key by using practical faint laser pulses. In our scheme, if all the m −1 sharers collaborate, they can obtain the joint secret key from the message sender. Our scheme is more feasible according to the present-day technology.

Chinese Physics Letters•Jun 16, 2005•32 citations

An efficient quantum secret sharing using secure direct communication

Mahsa Khorrampanah, Monireh Houshmand

Inspired by quantum secure direct communication, a three-party quantum secret sharing approach is proposed. In the preparation phase, the sender shares a GHZ state among users. After she ensures about the security of the channel, she generates an auxiliary GHZ state and keeps it. Then she encodes three-bit information on the GHZ states, by applying the appropriate gates on her qubits. In the decoding phase, the three parties measure their qubits. The receivers achieve no information on the encoded message individually and just when they know the others' measurement results have access to the secret message. The security of the preparation phase against various attacks is investigated. Since no qubits carrying the message are transmitted, the protocol is completely secure, if the perfect quantum channel is used. The proposed approach has a better efficiency as compared to the previous ones.

Iranian Conference on Electrical Engineering•May 1, 2013•10 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

Quantum secret sharing with shared key dependent on receivers

Juan Xu

A novel quantum secret sharing scheme between one and many parties with four states is proposed. Different from existing schemes, the bit value of shared key in this scheme depends on the operations done by the receivers, say Bobs, not the preparer Alice, which is highly applicable in some cases. This paper also gives the definition of qubit capacity, in order to signify the relative amount of quantum resource needed in schemes. The analysis shows that the qubit capacity of our scheme is 1, which means it saves quantum resource due to the absence of entanglement and bitwise Exclusive OR operations on qubits' measuring results. Besides, this scheme has features of being convenient for receivers, feasible with current technology, and also secure against some common attacks.

International Conference on Natural Computation (ICNC)•Jul 1, 2011•3 citations

Efficient multiparty quantum secret sharing of secure direct communication

Jian Wang, Quan Zhang, Chaojing Tang

In this paper, we present an (n, n) threshold quantum secret sharing scheme of secure direct communication using Greenberger-Horne-Zeilinger state. The present scheme is efficient in that all the Greenberger-Horne-Zeilinger states used in the quantum secret sharing scheme are used to generate shared secret messages except those chosen for checking eavesdropper. In our scheme, the measuring basis of communication parties is invariable and the classical information used to check eavesdropping needs only the results of measurements of the communication parties. Another nice feature of our scheme is that the sender transmit her secret messages to the receivers directly and the receivers recover the sender's secret by combining their results, different from the QSS scheme whose object is essentially to allow a sender to establish a shared key with the receivers. This feature of our scheme is similar to that of quantum secret direct communication.

arXiv:quant-ph/0510212•Oct 27, 2005•0 citations
We propose a new quantum secret sharing scheme using a single non-entangled qubit. In the scheme, by transmitting a qubit to the next party sequentially, a sender can securely transmit a secret message to NNN receivers who could only decode the message cooperatively after randomly shuffling the polarization of the qubit. We explain this quantum secret sharing scheme into the one between a sender and two receivers, and generalize the scheme between a sender and NNN receivers. Since our scheme is capable of using a faint coherent pulse as a qubit, it is experimentally feasible within current technology.
Inspired by quantum secure direct communication, a three-party quantum secret sharing approach is proposed. In the preparation phase, the sender shares a GHZ state among users. After she ensures about the security of the channel, she generates an auxiliary GHZ state and keeps it. Then she encodes three-bit information on the GHZ states, by applying the appropriate gates on her qubits. In the decoding phase, the three parties measure their qubits. The receivers achieve no information on the encoded message individually and just when they know the others' measurement results have access to the secret message. The security of the preparation phase against various attacks is investigated. Since no qubits carrying the message are transmitted, the protocol is completely secure, if the perfect quantum channel is used. The proposed approach has a better efficiency as compared to the previous ones.
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.
A novel quantum secret sharing scheme between one and many parties with four states is proposed. Different from existing schemes, the bit value of shared key in this scheme depends on the operations done by the receivers, say Bobs, not the preparer Alice, which is highly applicable in some cases. This paper also gives the definition of qubit capacity, in order to signify the relative amount of quantum resource needed in schemes. The analysis shows that the qubit capacity of our scheme is 1, which means it saves quantum resource due to the absence of entanglement and bitwise Exclusive OR operations on qubits' measuring results. Besides, this scheme has features of being convenient for receivers, feasible with current technology, and also secure against some common attacks.
In this paper, we present an (n, n) threshold quantum secret sharing scheme of secure direct communication using Greenberger-Horne-Zeilinger state. The present scheme is efficient in that all the Greenberger-Horne-Zeilinger states used in the quantum secret sharing scheme are used to generate shared secret messages except those chosen for checking eavesdropper. In our scheme, the measuring basis of communication parties is invariable and the classical information used to check eavesdropping needs only the results of measurements of the communication parties. Another nice feature of our scheme is that the sender transmit her secret messages to the receivers directly and the receivers recover the sender's secret by combining their results, different from the QSS scheme whose object is essentially to allow a sender to establish a shared key with the receivers. This feature of our scheme is similar to that of quantum secret direct communication.