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

IEEE Access

Single-Photon-Memory Two-Step Quantum Secure Direct Communication Relying on Einstein-Podolsky-Rosen Pairs

Dong Pan, Keren Li, Dong Ruan, Soon Xin Ng, Lajos Hanzo

Published Jan 1, 2020• 45 citations
Publisher

Abstract

Quantum secure direct communication (QSDC) is an important branch of quantum communication that is capable of directly transmitting secret messages over a quantum channel. It may be viewed as a concrete realization of Wyner's wiretap channel theory, which ensures the reliable and secure communication of information in the presence of noise and eavesdropping. Hence it is a fully-fledged quantum-communications protocol, which does not require a separate secret key negotiation phase. By contrast, its quantum key distribution (QKD) counterpart represents a secret key-negotiation protocol, which has to be followed up by a separate classical communication session. The essential difference between these two modes of quantum communication lies in the employment of a block-based data transmission technique, proposed by Long and Liu in 2000. However, the original block-based data transmission requires quantum memory, which is not widely available at the time of writing. Recently, this difficulty has been overcome by using classical coding theory, which has been successfully applied to the single-qubit DL04 QSDC. Here we will present a single-photon-memory QSDC protocol based on entangled pairs of photons. We commence by comparing QSDC to QKD, followed by an example of the single-photon QSDC and single-photon QKD protocol. Then we continue by modifying the so-called two-step QSDC protocol designed for deterministic QKD by reducing the number of qubits in a block into a single one, in which Alice prepares Einstein-Podolsky-Rosen (EPR) photon pairs and partitions them into two parts: the so-called pioneer qubit and the follow-up qubit. The pioneer photon is transferred first to Bob, while the follow-up photon is used either for performing encoding or for eavesdropping detection. Bob extracts the candidate key by combining the two particles of the EPR pair to perform Bell-basis measurement. Then the protocol is transformed into a single-photon-memory QSDC using coding theory. Our theoretical analysis shows that the resultant protocol is robust to individual attacks. Additionally, a high communication efficiency is achieved.

DOI
10.1109/access.2020.3006136

Related papers

Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block

Fu‐Guo Deng, Gui Lu Long, Xiao-Shu Liu

A protocol for quantum secure direct communication using blocks of Einstein-Podolsky-Rosen (EPR) pairs is proposed. A set of ordered N EPR pairs is used as a data block for sending secret message directly. The ordered N EPR set is divided into two particle sequences, a checking sequence and a message-coding sequence. After transmitting the checking sequence, the two parties of communication check eavesdropping by measuring a fraction of particles randomly chosen, with random choice of two sets of measuring bases. After insuring the security of the quantum channel, the sender Alice encodes the secret message directly on the message-coding sequence and sends them to Bob. By combining the checking and message-coding sequences together, Bob is able to read out the encoded messages directly. The scheme is secure because an eavesdropper cannot get both sequences simultaneously. We also discuss issues in a noisy channel.

arXiv:quant-ph/0308173•Physical Review A•Oct 20, 2003•1,773 citations

A Novel Deterministic Secure Quantum Communication Scheme with Einstein—Podolsky—Rosen Pairs and Single Photons

Chao Wang, Jianwei Liu, Xiao Liu +1 more

A novel deterministic secure quantum communication (DSQC) scheme is presented based on Einstein-Podolsky-Rosen (EPR) pairs and single photons in this study. In this scheme, the secret message can be encoded directly on the first particles of the prepared Bell states by simple unitary operations and decoded by performing the Bell-basis measurement after the additional classic information is exchanged. In addition, the strategy with two-step transmission of quantum data blocks and the technique of decoy-particle checking both are exploited to guarantee the security of the communication. Compared with some previous DSQC schemes, this scheme not only has a higher resource capacity, intrinsic efficiency and total efficiency, but also is more realizable in practical applications. Security analysis shows that the proposed scheme is unconditionally secure against various attacks over an ideal quantum channel and still conditionally robust over a noisy and lossy quantum channel.

Communications in Theoretical Physics•Oct 1, 2013•8 citations

Quantum secure direct communication

Xihan Li

Quantum secure direct communication (QSDC) is one of the most important branches of quantum communication. In contrast to the quantum key distribution (QKD) which distributes a secure key between distant parties, QSDC directly transmits secret message instead of sharing key in advance. To establish a secure QSDC protocol, on the one hand, the security of the quantum channel should be confirmed before the exchange of the secret message. On the other hand, the quantum state should be transmitted in a quantum data block since the security of QSDC is based on the error rate analysis in the theories on statistics. Compared with the deterministic quantum key distribution (DQKD) which can also be used to transmit deterministic information, QSDC schemes do not need extra classical bits to read the secret message except for public discussion. In this article, we introduce the basic principles of QSDC and review the development in this field by introducing typical QSDC protocols chronologically. The first QSDC protocol was proposed by Long and Liu, which can be used to establish a common key between distant parties. In their scheme, the method for transmitting quantum states in a block by block way and in multiple steps was proposed and the information leakage before eavesdropping detection was solved. Subsequently, Deng et al. presented two pioneering QSDC schemes, an entangled-state-based two-step QSDC scheme and a single-photon-state-based quantum one-time pad scheme, in which the basic principle and criteria for QSDC were pointed out. From then on, many interesting QSDC schemes have been proposed, including the high-dimension QSDC scheme based on quantum superdense coding, multi-step QSDC scheme based on Greenberger-Horne-Zeilinger states, QSDC scheme based on quantum encryption with practical non-maximally entangled quantum channel, and so on. We also introduce the anti-noise QSDC schemes which were designed for coping with the collective-dephasing noise and the collective-rotation noise, respectively. In 2011, Wang et al. presented the first QSDC which exploited the hyperentangled state as the information carrier and several QSDC schemes based on the spatial degree of freedom (DOF) of photon, single-photon multi-DOF state and hyperentanglement were proposed subsequently. In addition to the point-to-point QSDC schemes, we also review the QSDC networks. Finally, a perspective of QSDC research is given in the last section.

Acta Physica Sinica•Jan 1, 2015•43 citations

QUANTUM SECURE DIRECT COMMUNICATION WITH A CONSTANT NUMBER OF EPR PAIRS

Chin-Yung Lu, Shiou-An Wang, Yuh-Jiuh Cheng +1 more

In this paper, we propose a quantum secure direct communication (QSDC) protocol based on Einstein–Podolsky–Rosen (EPR) pairs. Previous QSDC protocols usually consume one EPR pair to transmit a single qubit. If Alice wants to transmit an n-bit message, she needs at least n/2 EPR pairs when a dense coding scheme is used. In our protocol, if both Alice and Bob preshare 2c + 1 EPR pairs with the trusted server, where c is a constant, Alice can transmit an arbitrary number of qubits to Bob. The 2c EPR pairs are used by Alice and Bob to authenticate each other and the remaining EPR pair is used to encode and decode the message qubit. Thus the total number of EPR pairs used for one communication is a constant no matter how many bits will be transmitted. It is not necessary to transmit EPR pairs before transmitting the secret message except for the preshared constant number of EPR pairs. This reduces both the utilization of the quantum channel and the risk. In addition, after the authentication, the server is not involved in the message transmission. Thus we can prevent the server from knowing the message.

International Journal of Quantum Information•Dec 1, 2010•5 citations

A Novel Deterministic Secure Quantum Communication Scheme with Einstein-Podolsky-Rosen Pairs and Single Photons

Wang Cha

A novel deterministic secure quantum communication(DSQC)scheme is presented based on EinsteinPodolsky-Rosen(EPR)pairs and single photons in this study.In this scheme,the secret message can be encoded directly on the first particles of the prepared Bell states by simple unitary operations and decoded by performing the Bell-basis measurement after the additional classic information is exchanged.In addition,the strategy with two-step transmission of quantum data blocks and the technique of decoy-particle checking both are exploited to guarantee the security of the communication.Compared with some previous DSQC schemes,this scheme not only has a higher resource capacity,intrinsic efciency and total efciency,but also is more realizable in practical applications.Security analysis shows that the proposed scheme is unconditionally secure against various attacks over an ideal quantum channel and still conditionally robust over a noisy and lossy quantum channel.

理论物理通讯：英文版•Jan 1, 2013•0 citations

Secure direct communication using step-split Einstein-Podolsky-Rosen pair

Qing-yu Cai

We presen a secure direct communication protocol by using step-split Einstein-Podolsky-Rosen (EPR) pair. In this communication protocol, Alice first sends one qubit of an EPR pair to Bob. Bob sends a receipt signal to Alice through public channel when he receives Alice's first qubit. Alice performs her encoding operations on the second qubit and sends this qubit to Bob. Bob performs a Bell-basis measurement to draw Alice's information. The security of this protocol is based on `High fidelity implies low entropy'. If Eve want to eavesdrop Alice's information, she has to attack both qubits of the EPR pair, which results in that any effective eavesdropping attack can be detected. Bob's receipt signal can protect this protocol against the eavesdropping hiding in the quantum channel losses. And this protocol is strictly secure to perform a quantum key distribution by using Calderbank-Shor-Steane codes.

arXiv:quant-ph/0311055•Nov 10, 2003•0 citations
Quantum secure direct communication (QSDC) is an important branch of quantum communication that is capable of directly transmitting secret messages over a quantum channel. It may be viewed as a concrete realization of Wyner's wiretap channel theory, which ensures the reliable and secure communication of information in the presence of noise and eavesdropping. Hence it is a fully-fledged quantum-communications protocol, which does not require a separate secret key negotiation phase. By contrast, its quantum key distribution (QKD) counterpart represents a secret key-negotiation protocol, which has to be followed up by a separate classical communication session. The essential difference between these two modes of quantum communication lies in the employment of a block-based data transmission technique, proposed by Long and Liu in 2000. However, the original block-based data transmission requires quantum memory, which is not widely available at the time of writing. Recently, this difficulty has been overcome by using classical coding theory, which has been successfully applied to the single-qubit DL04 QSDC. Here we will present a single-photon-memory QSDC protocol based on entangled pairs of photons. We commence by comparing QSDC to QKD, followed by an example of the single-photon QSDC and single-photon QKD protocol. Then we continue by modifying the so-called two-step QSDC protocol designed for deterministic QKD by reducing the number of qubits in a block into a single one, in which Alice prepares Einstein-Podolsky-Rosen (EPR) photon pairs and partitions them into two parts: the so-called pioneer qubit and the follow-up qubit. The pioneer photon is transferred first to Bob, while the follow-up photon is used either for performing encoding or for eavesdropping detection. Bob extracts the candidate key by combining the two particles of the EPR pair to perform Bell-basis measurement. Then the protocol is transformed into a single-photon-memory QSDC using coding theory. Our theoretical analysis shows that the resultant protocol is robust to individual attacks. Additionally, a high communication efficiency is achieved.
A protocol for quantum secure direct communication using blocks of Einstein-Podolsky-Rosen (EPR) pairs is proposed. A set of ordered N EPR pairs is used as a data block for sending secret message directly. The ordered N EPR set is divided into two particle sequences, a checking sequence and a message-coding sequence. After transmitting the checking sequence, the two parties of communication check eavesdropping by measuring a fraction of particles randomly chosen, with random choice of two sets of measuring bases. After insuring the security of the quantum channel, the sender Alice encodes the secret message directly on the message-coding sequence and sends them to Bob. By combining the checking and message-coding sequences together, Bob is able to read out the encoded messages directly. The scheme is secure because an eavesdropper cannot get both sequences simultaneously. We also discuss issues in a noisy channel.
A novel deterministic secure quantum communication (DSQC) scheme is presented based on Einstein-Podolsky-Rosen (EPR) pairs and single photons in this study. In this scheme, the secret message can be encoded directly on the first particles of the prepared Bell states by simple unitary operations and decoded by performing the Bell-basis measurement after the additional classic information is exchanged. In addition, the strategy with two-step transmission of quantum data blocks and the technique of decoy-particle checking both are exploited to guarantee the security of the communication. Compared with some previous DSQC schemes, this scheme not only has a higher resource capacity, intrinsic efficiency and total efficiency, but also is more realizable in practical applications. Security analysis shows that the proposed scheme is unconditionally secure against various attacks over an ideal quantum channel and still conditionally robust over a noisy and lossy quantum channel.
Quantum secure direct communication (QSDC) is one of the most important branches of quantum communication. In contrast to the quantum key distribution (QKD) which distributes a secure key between distant parties, QSDC directly transmits secret message instead of sharing key in advance. To establish a secure QSDC protocol, on the one hand, the security of the quantum channel should be confirmed before the exchange of the secret message. On the other hand, the quantum state should be transmitted in a quantum data block since the security of QSDC is based on the error rate analysis in the theories on statistics. Compared with the deterministic quantum key distribution (DQKD) which can also be used to transmit deterministic information, QSDC schemes do not need extra classical bits to read the secret message except for public discussion. In this article, we introduce the basic principles of QSDC and review the development in this field by introducing typical QSDC protocols chronologically. The first QSDC protocol was proposed by Long and Liu, which can be used to establish a common key between distant parties. In their scheme, the method for transmitting quantum states in a block by block way and in multiple steps was proposed and the information leakage before eavesdropping detection was solved. Subsequently, Deng et al. presented two pioneering QSDC schemes, an entangled-state-based two-step QSDC scheme and a single-photon-state-based quantum one-time pad scheme, in which the basic principle and criteria for QSDC were pointed out. From then on, many interesting QSDC schemes have been proposed, including the high-dimension QSDC scheme based on quantum superdense coding, multi-step QSDC scheme based on Greenberger-Horne-Zeilinger states, QSDC scheme based on quantum encryption with practical non-maximally entangled quantum channel, and so on. We also introduce the anti-noise QSDC schemes which were designed for coping with the collective-dephasing noise and the collective-rotation noise, respectively. In 2011, Wang et al. presented the first QSDC which exploited the hyperentangled state as the information carrier and several QSDC schemes based on the spatial degree of freedom (DOF) of photon, single-photon multi-DOF state and hyperentanglement were proposed subsequently. In addition to the point-to-point QSDC schemes, we also review the QSDC networks. Finally, a perspective of QSDC research is given in the last section.
In this paper, we propose a quantum secure direct communication (QSDC) protocol based on Einstein–Podolsky–Rosen (EPR) pairs. Previous QSDC protocols usually consume one EPR pair to transmit a single qubit. If Alice wants to transmit an n-bit message, she needs at least n/2 EPR pairs when a dense coding scheme is used. In our protocol, if both Alice and Bob preshare 2c + 1 EPR pairs with the trusted server, where c is a constant, Alice can transmit an arbitrary number of qubits to Bob. The 2c EPR pairs are used by Alice and Bob to authenticate each other and the remaining EPR pair is used to encode and decode the message qubit. Thus the total number of EPR pairs used for one communication is a constant no matter how many bits will be transmitted. It is not necessary to transmit EPR pairs before transmitting the secret message except for the preshared constant number of EPR pairs. This reduces both the utilization of the quantum channel and the risk. In addition, after the authentication, the server is not involved in the message transmission. Thus we can prevent the server from knowing the message.
A novel deterministic secure quantum communication(DSQC)scheme is presented based on EinsteinPodolsky-Rosen(EPR)pairs and single photons in this study.In this scheme,the secret message can be encoded directly on the first particles of the prepared Bell states by simple unitary operations and decoded by performing the Bell-basis measurement after the additional classic information is exchanged.In addition,the strategy with two-step transmission of quantum data blocks and the technique of decoy-particle checking both are exploited to guarantee the security of the communication.Compared with some previous DSQC schemes,this scheme not only has a higher resource capacity,intrinsic efciency and total efciency,but also is more realizable in practical applications.Security analysis shows that the proposed scheme is unconditionally secure against various attacks over an ideal quantum channel and still conditionally robust over a noisy and lossy quantum channel.
We presen a secure direct communication protocol by using step-split Einstein-Podolsky-Rosen (EPR) pair. In this communication protocol, Alice first sends one qubit of an EPR pair to Bob. Bob sends a receipt signal to Alice through public channel when he receives Alice's first qubit. Alice performs her encoding operations on the second qubit and sends this qubit to Bob. Bob performs a Bell-basis measurement to draw Alice's information. The security of this protocol is based on `High fidelity implies low entropy'. If Eve want to eavesdrop Alice's information, she has to attack both qubits of the EPR pair, which results in that any effective eavesdropping attack can be detected. Bob's receipt signal can protect this protocol against the eavesdropping hiding in the quantum channel losses. And this protocol is strictly secure to perform a quantum key distribution by using Calderbank-Shor-Steane codes.