Efficient Three-Party Quantum Secret Sharing with Single Photons

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.     

Scalable Quantum Secret Sharing Extended from Quantum Key Distribution

We suggest a general approach for extending quantum key distribution （Q, KD） protocols possessing discrete rotational symmetry into quantum secret sharing （QSS） schemes among multiparty, under certain conditions. Only local unitary operations are required for this generalization based on the almost mature technologies of Q, KD. Theoretically, the number of the participating partners can be arbitrary high. As an application of this method, we propose a fault-tolerant QSS protocol based on a fault-tolerant QKD implementation. The 6-state protocol is also discussed.     

Efficient Multiparty-to-Multiparty Quantum Secret Sharing via Continuous Variable Operations

The one-to-multiparty quantum secret sharing scheme [Phys. Rev. A 71 （2005） 044301] proposed recently is extended to a multiparty-to-multiparty case. Furthermore, the continuous variable operations are employed in the extended scheme to replace the specific discrete unitary operations used in the original scheme. The complete randomicity of the continuous variable characterizing the unitary operations can ensure the security of secret sharing. Moreover, the present scheme is compared with the recent similar scheme [Phys. Rev. A 72 （2005） 012304]. It is found that the efficiency of the present scheme is n times of that of the previous one.     

Threshold Quantum Secret Sharing of Secure Direct Communication

We propose a （L, n）-threshold quantum secret sharing protocol of secure direct communication following some ideas of Zhang＇s protocol [Phys. Lett. A 342 （2005） 60] and Tokunaga et al.＇s protocol [Phys. Rev. A 71 （2005） 012314]. The sender distributes the classical secret shares to his or her n agents and each agent owns a secret share in advance. The sender＇s secure direct communication message can be extracted by an agent subset by collaboration in such a way that at least t or more agents can obtain the secret message with the mutual assistances but any t - 1 or fewer agents cannot. In contrast to the previous multiparty quantum secret sharing protocols in which the sender＇s secret message can be recovered only if all the agents collaborate, our protocol is more practical and more flexible.     

Quantum Secret Sharing Using GHZ-Like State

This paper presents a simple and novel quantum secret sharing scheme using GHZ-like state. The characteristics of the GHZ-like state are used to develop the quantum secret sharing scheme. In contrast with the other GHZ-based QSS protocols with the same assumptions, the proposed protocol provides the best quantum bit efficiency.     

Quantum Secret Sharing Protocol between Multiparty and Multiparty with Single Photons and Unitary Transformations

We propose a scheme of quantum secret sharing between Alice＇s group and Bob＇s group with single photons and unitary transformations. In the protocol, one member in Alice＇s group prepares a sequence of single photons in one of four different states, while other members directly encode their information on the sequence of single photons via unitary operations; after that, the last member sends the sequence of single photons to Bob＇s group. Then Bob＇s, except for the last one, do work similarly. Finally the last member in Bob＇s group measures the qubits. If the security of the quantum channel is guaranteed by some tests, then the qubit states sent by the last member of Alice＇s group can be used as key bits for secret sharing. It is shown that this scheme is safe.     

Quantum Secret Sharing Using GHZ-Like State

This paper presents a simple and novel quantum secret sharing schemeusing GHZ-like state. The characteristics of the GHZ-like state areused to develop the quantum secret sharing scheme. In contrast withthe other GHZ-based QSS protocols with the same assumptions, the proposed protocol provides the best quantum bit efficiency.     

Novel Quantum Secret Sharing and Controlled Communication Schemes Based on Einstein-Podolsky-Rosen Correlations

Employing quantum registers, we first proposed a novel （2, 3） quantum threshold scheme based on Einstein- Podolsky Rosen （EPR） correlations in this letter. Motivated by the present threshold scheme, we also propose a controlled communication scheme to transmit the secret message with a controller. In the communication protocol, the encoded quantum message carried by particles sequence, is transmitted by legitimate communicators.     

Multiparty Quantum Secret Sharing Using Quantum Fourier Transform

A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Fhrthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.     

Cryptanalysis of Multiparty Quantum Secret Sharing of Quantum State Using Entangled States

Security of a quantum secret sharing of quantum state protocol proposed by Guo et al. [Chin. Phys. Lett. 25 （2008） 16] is reexamined. It is shown that an eavesdropper can obtain some of the transmitted secret information by monitoring the classical channel or the entire secret by intercepting the quantum states, and moreover, the eavesdropper can even maliciously replace the secret message with an arbitrary message without being detected. Finally, the deep reasons why an eavesdropper can attack this protocol are discussed and the modified protocol is presented to amend the security loopholes.     

Three-Party Simultaneous Quantum Secure Direct Communication Scheme with EPR Pairs

We present a scheme for three-party simultaneous quantum secure direct communication by using EPR pairs. In the scheme, three legitimate parties can simultaneously exchange their secret messages. The scheme is also proven to be secure against the intercept-and-resend attack, the disturbance attack and the entangled-and- measure attack.     

Multiparty Quantum Secret Sharing of Secure Direct Communication Using Teleportation

We present an (n,n) threshold quantum secret sharing scheme of secure direct communication using Greenberger-Horne-Zeilinger state and teleportation.After ensuring the security of the quantum channel,the sender encodes the secret message directly on a sequence of particle states and transmits it to the receivers by teleportation.The receivers can recover the secret message by combining their measurement results with the sender's result.If a perfect quantum channel is used,our scheme is completely secure because the transmitting particle sequence does not carry the secret message.We also show our scheme is secure for noise quantum channel.     

Quantum Secret Sharing with Error Correction

We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sent qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code. We compare in this paper the three codes by computing the average fidelity between the sent secret and that measured by the receivers. We will treat the case where, at most, two qubits are affected in each one of five depolarizing channels.     

Reexamining Security of Improved Multiparty Quantum Secret Splitting and Quantum State Sharing

In a recent letter [H.F. Wang, X. Ji, and S. Zhang, Phys. Lett. A 358 （2006） 11], an improvement of the multiparty quantum secret splitting and quantum state sharing protocol [F.G. Deng, et al., Phys. Lett. A 354 （2006） 190.] was presented. We study the security of the improved protocol and find that two or more dishonest participants may recover the secret from the dealer. Hence we further modify the improved protocol, which make it stand against this kind of attack.     

Quantum Secret Sharing with Error Correction

We investigate in this work a quantum error correction on a five-qubits graph state used for secret sharing through five noisy channels. We describe the procedure for the five, seven and nine qubits codes. It is known that the three codes always allow error recovery if only one among the sent qubits is disturbed in the transmitting channel. However, if two qubits and more are disturbed, then the correction will depend on the used code. We compare in this paper the three codes by computing the average fidelity between the sent secret and that measured by the receivers. We will treat the case where, at most, two qubits are affected in each one of five depolarizing channels.     

Quantum Secret Sharing Based on Chinese Remainder Theorem

A novel quantum secret sharing (QSS) scheme is proposed on the basis of Chinese Remainder Theorem (CRT). In the scheme, the classical messages are mapped to secret sequences according to CRT equations, and distributed to different receivers by different dimensional superdense-coding respectively. CRT's secret sharing function,together with high-dimensional superdense-coding, provide convenience, security, and large capability quantum channel forsecret distribution and recovering. Analysis shows the security of the scheme.     

Robust Multiparty Quantum Secret Sharing against Participant ForcibleManipulation

The security of the multiparty quantum secret sharing protocol proposed by Gao [G. Gao, Commun. Theor. Phys. 52 (2009) 421] isanalyzed. It is shown that this protocol is vulnerable since theagents' imperfect encryption scheme can be attacked by a powerfulparticipant. We introduce a attack strategy called participant forcible manipulation and analyze the information leakage in this protocol under this attack. At last, we give an improved version of the original protocol. The improved protocol is robust and has the same efficiency as the original one.     

Secure Quantum Secret Sharing Based on Reusable GHZ States as Secure Carriers

We show that a potential eavesdropper can eavesdrop whole secret information when the legitimate users use secure carrier to encode and decode classical information repeatedly in the protocol proposed by Bagherinezhad S and Karimipour V [Phys. Rev. A 67（2003）044302]. Then we present a revised quantum secret sharing protocol by using the Greenberger-Horne-Zeilinger state as secure carrier. Our protocol can resist Eve＇s attack.     

Robust Multiparty Quantum Secret Sharing against Participant Forcible Manipulation

The security of the multiparty quantum secret sharing protocol proposed by Gao [G. Gao, Commun. Theor. Phys. 52 （2009） 421] is analyzed. It is shown that this protocol is vulnerable since the agents＇ imperfect encryption scheme can be attacked by a powerful participant. We introduce a attack strategy called participant forcible manipulation and analyze the information leakage in this protocol under this attack. At last, we give an improved version of the original protocol. The improved protocol is robust and has the same efficiency as the original one.