arXiv subjects

Fu-Guo Deng

Publications and source records attributed to Fu-Guo Deng.

At least 127 records · Page 7Linked to original sources

arXiv2007

Quantum secure direct communication network with superdense coding and decoy photons

A quantum secure direct communication network scheme is proposed with quantum superdense coding and decoy photons. The servers on a passive optical network prepare and measure the quantum signal, i.e., a sequence of the $d$-dimensional Bell states. After confirming the security of the photons received from the receiver, the sender codes his secret message on them directly. For preventing a dishonest server from eavesdropping, some decoy photons prepared by measuring one photon in the Bell states are used to replace some original photons. One of the users on the network can communicate any other one. This scheme has the advantage of high capacity, and it is more convenient than others as only a sequence of photons is transmitted in quantum line.

quant-ph↗

arXiv2007

Multiparty quantum secret sharing with pure entangled states and decoy photons

We present a scheme for multiparty quantum secret sharing of a private key with pure entangled states and decoy photons. The boss, say Alice uses the decoy photons, which are randomly in one of the four nonorthogonal single-photon states, to prevent a potentially dishonest agent from eavesdropping freely. This scheme requires the parties of communication to have neither an ideal single-photon quantum source nor a maximally entangled one, which makes this scheme more convenient than others in a practical application. Moreover, it has the advantage of having high intrinsic efficiency for qubits and exchanging less classical information in principle.

quant-ph↗

arXiv2007

Controlled Teleportation of an Arbitrary Multi-Qudit State in a General Form with d-Dimensional Greenberger-Horne-Zeilinger States

A general scheme for controlled teleportation of an arbitrary multi-qudit state with d-dimensional Greenberger-Horne-Zeilinger (GHZ) states is proposed. For an arbitrary m-qudit state, the sender Alice performs m generalized Bell-state projective measurements on her 2m qudits and the controllers need only take some single-particle measurements. The receiver Charlie can reconstruct the unknown m-qudit state by performing some single-qudit unitary operations on her particles if she cooperates with all the controllers. As the quantum channel is a sequence of maximally entangled GHZ states, the intrinsic efficiency for qudits in this scheme approaches 100% in principle.

quant-ph↗

arXiv2007

Eavesdropping on the "Ping-Pong" Quantum Communication Protocol Freely in a Noise Channel

We introduce an attack scheme for eavesdropping the ping-pong quantum communication protocol proposed by Bostr$\ddot{o}$m and Felbinger [Phys. Rev. Lett. \textbf{89}, 187902 (2002)] freely in a noise channel. The vicious eavesdropper, Eve, intercepts and measures the travel photon transmitted between the sender and the receiver. Then she replaces the quantum signal with a multi-photon signal in a same state, and measures the photons return with the measuring basis with which Eve prepares the fake signal except for one photon. This attack increase neither the quantum channel losses nor the error rate in the sampling instances for eavesdropping check. It works for eavesdropping the secret message transmitted with the ping-pong protocol. Finally, we propose a way for improving the security of the ping-pong protocol.

quant-ph↗

arXiv2007

Secure quantum key distribution network with Bell states and local unitary operations

We propose a theoretical scheme for secure quantum key distribution network following the ideas in quantum dense coding. In this scheme, the server of the network provides the service for preparing and measuring the Bell states, and the users encodes the states with local unitary operations. For preventing the server from eavesdropping, we design a decoy when the particle is transmitted between the users. It has high capacity as one particle carries two bits of information and its efficiency for qubits approaches 100%. Moreover, it is not necessary for the users to store the quantum states, which makes this scheme more convenient for application than others.

quant-ph↗

arXiv2007

Efficient quantum cryptography network without entanglement and quantum memory

An efficient quantum cryptography network protocol is proposed with d-dimension polarized photons, without resorting to entanglement and quantum memory. A server on the network, say Alice, provides the service for preparing and measuring single photons whose initial state are |0>. The users code the information on the single photons with some unitary operations. For preventing the untrustworthy server Alice from eavesdropping the quantum lines, a nonorthogonal-coding technique (decoy-photon technique) is used in the process that the quantum signal is transmitted between the users. This protocol does not require the servers and the users to store the quantum state and almost all of the single photons can be used for carrying the information, which makes it more convenient for application than others with present technology. We also discuss the case with a faint laser pulse.

quant-ph↗

arXiv2007

Opaque Attack on Three-Party Quantum Secret Sharing Based on Entanglement

Security of the three-party quantum secret sharing (QSS) schemes based on entanglement and a collective eavesdropping check is analyzed in the case of considerable quantum channel losses. An opaque attack scheme is presented for the dishonest agent to eavesdrop the message obtained by the other agent freely, which reveals that these QSS schemes are insecure for transmission efficiencies lower than 50%, especially when they are used to share an unknown quantum state. Finally, we present a general way to improve the security of QSS schemes for sharing not only a private key but also an unknown quantum state.

quant-ph↗

arXiv2006

Multiparty Quantum Remote Secret Conference

We present two schemes for multiparty quantum remote secret conference in which each legitimate conferee can read out securely the secret message announced by another one, but a vicious eavesdropper can get nothing about it. The first one is based on the same key shared efficiently and securely by all the parties with Greenberger-Horne-Zeilinger (GHZ) states, and each conferee sends his secret message to the others with one-time pad crypto-system. The other one is based on quantum encryption with a quantum key, a sequence of GHZ states shared among all the conferees and used repeatedly after confirming their security. Both these schemes are optimal as their intrinsic efficiency for qubits approaches the maximal value.

quant-ph↗

arXiv2006

Circular quantum secret sharing

A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three. We describe the process of this protocol and discuss its security when the quantum information carrying is polarized single photons running circularly. It will be shown that entanglement is not necessary for quantum secret sharing. Moreover, the theoretic efficiency is improved to approach 100% as almost all the instances can be used for generating the private key, and each photon can carry one bit of information without quantum storage. It is straightforwardly to utilize this topological structure to complete quantum secret sharing with multi-level two-particle entanglement in high capacity securely.

quant-ph↗

arXiv2006

Improving the security of secure direct communication based on secret transmitting order of particles

We analyzed the security of the secure direct communication protocol based on secret transmitting order of particles recently proposed by Zhu, Xia, Fan, and Zhang [Phys. Rev. A 73, 022338 (2006)], and found that this scheme is insecure if an eavesdropper, say Eve, wants to steal the secret message with Trojan horse attack strategies. The vital loophole in this scheme is that the two authorized users check the security of their quantum channel only once. Eve can insert another spy photon, an invisible photon or a delay one in each photon which the sender Alice sends to the receiver Bob, and capture the spy photon when it returns from Bob to Alice. After the authorized users check the security, Eve can obtain the secret message according to the information about the transmitting order published by Bob. Finally, we present a possible improvement of this protocol.

quant-ph↗

arXiv2006

Deterministic secure quantum communication without maximally entangled states

Two deterministic secure quantum communication schemes are proposed, one based on pure entangled states and the other on $d$-dimensional single-photon states. In these two schemes, only single-photon measurements are required for the two authorized users, which makes the schemes more convenient than others in practical applications. Although each qubit can be read out after a transmission of additional classical bit, it is unnecessary for the users to transmit qubits double the distance between the sender and the receiver, which will increase their bit rate and their security. The parties use decoy photons to check eavesdropping efficiently. The obvious advantage in the first scheme is that the pure entangled source is feasible with present techniques.

quant-ph↗

arXiv2006

Quantum secure direct communication network with Einstein-Podolsky-Rosen pairs

We discuss the four requirements for a real point-to-point quantum secure direct communication (QSDC) first, and then present two efficient QSDC network schemes with an N ordered Einstein-Podolsky-Rosen pairs. Any one of the authorized users can communicate another one on the network securely and directly.

quant-ph↗

arXiv2006

Quantum state sharing of an arbitrary two-qubit state with two-photon entanglements and Bell-state measurements

Two schemes for sharing an arbitrary two-qubit state based on entanglement swapping are proposed with Bell-state measurements and local unitary operations. One is based on the quantum channel with four Einstein-Podolsky-Rosen (EPR) pairs shared in advance. The other is based on a circular topological structure, i.e., each user shares an EPR pair with his neighboring one. The advantage of the former is that the construction of the quantum channel between the agents is controlled by the sender Alice, which will improve the security of the scheme. The circular scheme reduces the quantum resource largely when the number of the agents is large. Both of those schemes have the property of high efficiency as almost all the instances can be used to split the quantum information. They are more convenient in application than the other schemes existing as they require only two-qubit entanglements and two-qubit joint measurements for sharing an arbitrary two-qubit state.

quant-ph↗

arXiv2006

Multiparty Quantum Secret Report

A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her $M$ agents first share a sequence of ($M$+1)-particle Greenberger--Horne--Zeilinger (GHZ) states that only Alice knows which state each ($M$+1)-particle quantum system is in. Each agent exploits a controlled-not (CNot) gate to encrypt the travelling particle by using the particle in the GHZ state as the control qubit. The boss Alice decrypts the travelling particle with a CNot gate after performing a $σ_x$ operation on her particle in the GHZ state or not. After the GHZ states (the quantum key) are used up, the parties check whether there is a vicious eavesdropper, say Eve, monitoring the quantum line, by picking out some samples from the GHZ states shared and measure them with two measuring bases. After confirming the security of the quantum key, they use the GHZ states remained repeatedly for next round of quantum communication. This scheme has the advantage of high intrinsic efficiency for qubits and the total efficiency.

quant-ph↗

arXiv2006

Fake-signal-and-cheating attack on quantum secret sharing

We present a fake-signal-and-cheating attack strategy for the dishonest agent in quantum secret sharing (QSS) to steal the information of the other agents' fully and freely. It is found that almost all the QSS protocols existing, such as the two famous QSS protocols, the Hillery-Bu$\check{z}$ek-Berthiaume [Phys. Rev. A \textbf{59}, 1829 (1999)] and the Karlsson-Koashi-Imoto [Phys. Rev. A \textbf{59}, 162 (1999)], can be eavesdropped freely if the process for the eavesdropping check is accomplished with the cooperation of the dishonest agent. He can sends a fake signal to the other agents after intercepting the original photons and storing them. His action can be hidden with entanglement swapping and cheating when the photons are chosen as the samples for checking eavesdropping. Finally, we present a possible improvement of these QSS protocols' security with decoy photons.

quant-ph↗

arXiv2006

Efficient symmetric multiparty quantum state sharing of an arbitrary m-qubit state

We present a scheme for symmetric multiparty quantum state sharing of an arbitrary $m$-qubit state with $m$ Greenberger-Horne-Zeilinger states following some ideas from the controlled teleportation [Phys. Rev. A \textbf{72}, 02338 (2005)]. The sender Alice performs $m$ Bell-state measurements on her $2m$ particles and the controllers need only to take some single-photon product measurements on their photons independently, not Bell-state measurements, which makes this scheme more convenient than the latter. Also it does not require the parties to perform a controlled-NOT gate on the photons for reconstructing the unknown $m$-qubit state and it is an optimal one as its efficiency for qubits approaches the maximal value.

quant-ph↗

arXiv2006

Multiparty quantum secret splitting and quantum state sharing

A protocol for multiparty quantum secret splitting is proposed with an ordered $N$ EPR pairs and Bell state measurements. It is secure and has the high intrinsic efficiency and source capacity as almost all the instances are useful and each EPR pair carries two bits of message securely. Moreover, we modify it for multiparty quantum state sharing of an arbitrary $m$-particle entangled state based on quantum teleportation with only Bell state measurements and local unitary operations which make this protocol more convenient in a practical application than others.

quant-ph↗

arXiv2006

An efficient quantum secret sharing scheme with Einstein-Podolsky-Rosen Pairs

An efficient quantum secret sharing scheme is proposed. In this scheme, the particles in an entangled pair group form two particle sequences. One sequence is sent to Bob and the other is sent to Charlie after rearranging the particle orders. Bob and Charlie make coding unitary operations and send the particles back. Alice makes Bell-basis measurement to read their coding operations.

quant-ph↗