Volume 1, Issue 4 e26
ORIGINAL PAPER
Full Access

Security of quantum secure direct communication based on Wyner's wiretap channel theory

Jiawei Wu

Jiawei Wu

State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics, Tsinghua University, Beijing, China

Search for more papers by this author
Zaisheng Lin

Corresponding Author

Zaisheng Lin

School of Information and Technology, Tsinghua University, Beijing, China

Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China

Zaisheng Lin, School of Information and Technology, Tsinghua University, Beijing 100084, China.

Email: [email protected]

Search for more papers by this author
Liuguo Yin

Liuguo Yin

School of Information and Technology, Tsinghua University, Beijing, China

Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China

Search for more papers by this author
Gui-Lu Long

Gui-Lu Long

State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics, Tsinghua University, Beijing, China

Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China

Innovative Center of Quantum Matter, Beijing, China

Beijing Academy of Quantum Information Science, Beijing, China

Search for more papers by this author
First published: 29 October 2019
Citations: 95

Summary

Quantum secure direct communication (QSDC) transmits secret messages directly over a quantum channel without the prior distribution of a key. Here, we apply Wyner's wiretap channel theory to analyze the security of QSDC protocols. The ideal protocol is treated as the main channel, and the effect of eavesdropping is treated as the wiretap channel. Entanglement-based QSDC protocols are analyzed in detail at first. We calculated the channel capacity of the wiretap channel, and hence, the secrecy channel capacity of the protocol. The security of single-photon–based QSDC protocols is studied through the equivalence between the entanglement-based protocols and single-photon–based protocols. We present a modified version of the single-photon-based DL04 protocol, which gives a higher secrecy capacity.

1 INTRODUCTION

In traditional cryptography, distributing a secret key is a vulnerable process. Quantum key distribution (QKD)1 can ensure the information-theoretic security of the distributed key based on the principle of quantum mechanics, thus ensuring the security of the message transmitted in the classic channel with one-time-pad encryption. An alternative way is to transmit the message in quantum channels directly. Such an idea has motivated a batch of protocols called quantum secure direct communication (QSDC), including the entanglement-based two-step protocols2, 3 and the single-photon–based DL04 protocol,4 and attracts widespread attention. Multistep QSDC with Greenberger-Horne-Zeilinger state and high-dimension QSDC with superdense coding have been proposed.5, 6 Lum et al explored the use of quantum data locking in QSDC.7 Massa et al proposed a QSDC protocol where the direction of transmission is anonymous.8 Shapiro et al investigated the use of quantum low probability of intercept to realize high rate QSDC.9 Furthermore, the measurement-device-independent protocols for QSDC, which could eliminate security loopholes with imperfect measurement devices, have been proposed.10-12 Device-independent QSDC protocol, which could eliminate all possible security loopholes associated with imperfect devices, has also been proposed quite recently.13

In recent years, there has been remarkable progress in practical realization of QSDC. In 2016, Hu et al completed the first experimental demonstration of DL04 protocol with faint laser, validating the feasibility of QSDC in a noisy environment.14 The two-step protocol was realized over 0.5-km optical fiber, showing the potential of its long-distance transmission.15 Zhang et al demonstrated the application of atomic quantum memory in the entanglement-based protocol.16 However, practical quantum memory is far from available. Sun et al solved the problem by proposing a practical scheme without quantum memory based on classical coding theory.17

In contrast to QKD, whose security has been proven over the last two decades,18-24 the security analysis of QSDC protocols has only recently debuted.25, 26 Qi et al26 analyzed the security of DL04 QSDC protocol using Wyner's wiretap channel theory,27 and set up a practical prototype, which can send secure messages directly at a distance of over 1.5 km with a transmission rate of 50 bps.

Since QSDC transmits secret messages directly over quantum channels, post-processing is not possible. Therefore, the security analysis of QSDC is completely different from that of QKD. Fortunately, there are many powerful tools in information theory that can help to complete this task. Wyner's wiretap channel theory proves that there exist coding schemes that can ensure the secure transmission of the messages if the secrecy capacity is greater than zero. The wiretap channel model includes a main channel from Alice to Bob and a wiretap channel from Alice to Eve, as shown in Figure 1. The model gives a secrecy capacity, which is the maximal secure transmission rate between Alice and Bob.

Details are in the caption following the image
The framework of wiretap channel model. The whole quantum part is composed of two channels: the main channel and the wiretap channel. Message M enters the sender's entry after encoding and restore to urn:x-wiley:que2:media:que226:que226-math-0001 after the receiver's output and decoding

The whole communication process of the two-step protocol3 includes the quantum part and the classical part. In the quantum part, Alice prepares N Einstein-Podolsky-Rosen (EPR) pairs and sends each half of them to Bob. On receiving the particles, Bob checks the error rates by sampling some of the qubits and measuring them in the σx or σz bases. Alice encodes her classical bit sequence A on the EPR pairs using dense coding and sends the remaining halves to Bob. Bob decodes the EPR pairs to get sequence B, which is the message received by Bob. The whole quantum part can be treated in a wiretap channel model, in which Alice sends some messages to Bob, while an eavesdropper tries to eavesdrop it. In the classical part, the information of eavesdropping checking is transmitted in a public channel where Eve can get all the information. The secrecy capacity, which is the maximal difference between the capacity of the main channel and the wiretap channel, can be calculated using the parameters from eavesdropping checking. This is in sharp contrast to classical communication where it is almost impossible for legitimate users to acquire the capacity of the wiretap channel. The quantum channel provides a powerful tool to probe eavesdropping, thus gives a tight estimation of the channel capacity.

In the following, we give a proof of the security of two-step QSDC based on the wiretap channel theory and calculate its secrecy capacity. We find that this capacity is slightly smaller than that obtained from the entanglement distillation scheme,18, 19 which is expected because of the complicated quantum processing involved. Wyner's theory is more appealing for practical applications as it does not use the complicated quantum operations as in the quantum distillation process. Moreover, the secrecy capacity of generic single-photon–based QSDC protocols is also obtained through the equivalence between entanglement-based protocols and single-photon–based protocols. Based on the result, we propose some modification on DL04 protocol to increase its secrecy capacity.

This paper is organized as follows. In Section 2, we describe the detailed process of two-step protocol. Then, we estimate the information leakage in the quantum part and give the secrecy capacity of the channel. In Section 3, the security of DL04 protocol is given. By modifying the DL04 protocol, we can get a larger secrecy capacity. In Section 4, we give a concise summary.

2 SECURITY ANALYSIS OF THE TWO-STEP QSDC PROTOCOL

The two-step QSDC works as follows.3
  • (1) Prepare EPR pairs. Alice prepares 2n maximally entangled EPR pairs |ψ⊗2n, where urn:x-wiley:que2:media:que226:que226-math-0002. Alice sends each half of the EPR pairs to Bob, which is called system B.
  • (2) Eavesdropping checking. Bob randomly chooses n qubits as check bits and measures them in the bases of σz or σx randomly. Then, Bob tells Alice the positions of the qubits and measurement bases he has chosen. Alice does the same measurement and shares her results with Bob. They can obtain quantum bit error rates (QBERs) in the two measured bases, εx and εz. If the QBERs exceed some threshold, which will be given later, the protocol aborts.
  • (3) Dense coding. Alice applies one of the following four unitary operations to her qubits to encode 00, 01, 10, 11, respectively,
    urn:x-wiley:que2:media:que226:que226-math-0003()
    Then, she sends them to Bob.
  • (4) Decode message. On receiving the qubits from Alice, Bob combines the two halves of EPR pairs and measures them with Bell basis to obtain the message.

The degree of eavesdropping can be estimated through the QBER. It is worth noting that classical privacy amplification,28 which is used in QKD, is unsuitable for direct communication because part of intelligible information may be lost. In practical application, forward coding will be implemented.26 However, we will not go into the details here. In this section, we will estimate the lower bound of the secrecy capacity of two-step protocol.

In a general sense, any secret communication protocol can be treated in a wiretap channel model. For a QSDC protocol, the transmission of messages in the quantum channel between Alice and Bob is modeled as a main channel and the eavesdropping and environmental noises are modeled as a wiretap channel. Then, according to Wyner's wiretap channel theory,27, 29, 30 there exists a coding method that allows the secure transmission of information at a rate lower than the secrecy capacity, provided that the secrecy capacity is positive. The secrecy capacity can be calculated as follows:
urn:x-wiley:que2:media:que226:que226-math-0004()
where CM and CW are the capacity of the main channel and the wiretap channel, respectively.

To estimate the wiretap channel capacity, we need to analyze the detailed process of eavesdropping. Our analysis follows the method of Renner et al.21 Firstly, we assume Eve performs a coherent attack. Specifically, Eve attaches her auxiliary system |E⟩ to system B and performs a unitary operation UBE, then she sends system B to Bob. The entire state of system B before the operation is the direct product of independent and identically distributed (i.i.d.) systems, ρB=[(|0⟩⟨0|+|1⟩⟨1|)/2]⊗2n. If a randomized permutation is applied to the qubits, the joint state of B and E, ρBE, can be seen as a direct product of i.i.d. subsystems ρBEsub asymptotically, according to quantum De Finetti theorem.31 In other words, we can construct a state ρBEsub to approximate ρBE: urn:x-wiley:que2:media:que226:que226-math-0005. It is sufficient to consider Eve's operation UBE on every subsystem separately, which is the case of collective attack. For convenience, subscript sub is neglected in the following discussion.

After the operation of Eve, the state of EPR pair becomes
urn:x-wiley:que2:media:que226:que226-math-0006()
To simplify the effect of the attack on the system, we introduce an additional operation that Alice and Bob both apply the same transformation chosen randomly from I,σx,σz,σxσz. Such operation can eliminate all the nondiagonal elements of ρAB in Bell basis,22 then it has the following matrix form in the basis {|ψ⟩,|ψ+⟩,|ϕ⟩,|ϕ+⟩}:
urn:x-wiley:que2:media:que226:que226-math-0007()
Consider a purification |ψABE⟩ of state ρAB
urn:x-wiley:que2:media:que226:que226-math-0008()
where |Φi⟩ is the Bell state of system AB and {|Ei⟩} is a set of orthogonal states of Eve's auxiliary system. The parameters λi are constrained by QBER εx and εz: εz=λ3+λ4,εx=λ2+λ4. The state after the dense coding of Alice is Ua|ψABE⟩, where Ua∈{U00,U01,U10,U11}.
Finally, Eve intercepts all the qubits from Alice in the last step to obtain maximal information about the message and measure them, ie, Eve acquires system AE. Tracing out system B from system ABE, we get
urn:x-wiley:que2:media:que226:que226-math-0009()
where P|ψ is the projection operator of state |ψ⟩ and we have defined
urn:x-wiley:que2:media:que226:que226-math-0010
The encoded states are
urn:x-wiley:que2:media:que226:que226-math-0011
Eve can measure all the subsystems ρAE,a jointly. However, the information acquired from one subsystem on average in adjoint measurement cannot exceed that in single measurement of one subsystem. To explain this, consider the situation when the classical bit string urn:x-wiley:que2:media:que226:que226-math-0012 is encoded in some manner and assume urn:x-wiley:que2:media:que226:que226-math-0013, with a distribution urn:x-wiley:que2:media:que226:que226-math-0014, where ai is a two-bit word. Applying Holevo bound,32 we get
urn:x-wiley:que2:media:que226:que226-math-0015()
where urn:x-wiley:que2:media:que226:que226-math-0016 is system AE encoded with bit string {ai} and we have assumed each word ai has the same distribution pa. Therefore, it is sufficient to estimate the maximum of I(A:E) by analyzing one subsystem. The upper bound on I(A:E) gives the wiretap channel capacity (see Appendix A for details)
urn:x-wiley:que2:media:que226:que226-math-0017()
The capacity of the main channel CM depends on the bit error rate between classical information A and B. We can reasonably assume that the main channel is a symmetric channel, and then, considering the channel loss, the lower bound of the secrecy capacity is
urn:x-wiley:que2:media:que226:que226-math-0018()
where h4(e) is four-array Shannon entropy, QB and QE are the reception rates of the main channel and the wiretap channel, respectively, and e is the error rate distribution of the main channel. The error distribution e can be obtained through the decoding process.

In addition, the random permutation to reduce coherent attack to collective attack and random local operation to eliminate nondiagonal elements of ρAB can be removed from the protocol. From the perspective of Alice and Bob, any random operation on system AB will introduce an external auxiliary system. Since the details of the operation are transmitted in the public channel, the auxiliary systems can be utilized by Eve and may increase her power. If the operations above are removed, the secrecy capacity above remains a lower bound.

Another method to ensure security is entanglement distillation originated from the works of Lo and Chau18 and Shor and Preskill.19 After the distribution of EPR pairs, they do an additional operation of entanglement distillation according to the result of eavesdropping checking. The achievable efficiency of entanglement distillation is 1−h(εx)−h(εz), then the secrecy capacity is Cs=[1−h(εx)−h(εz)][2−h4(e)], where the second item is the classical capacity between Alice and Bob after entanglement distillation. To make comparison, we can reasonably assume the qubits of each EPR pair go through the same quantum channel independently without loss. If the quantum channel is modeled as a lossless depolarizing channel urn:x-wiley:que2:media:que226:que226-math-0019, the error rates of σx and σz measurement in eavesdropping checking are p/2. After both qubits of an EPR pair pass the channel, the depolarizing probability is 2pp2.33 The secrecy capacities are plotted in Figure 2. The secrecy capacity of the wiretap channel method has less tolerance for error rate, but it can utilize practical classical coding, while the entanglement distillation method requires a quantum computer.

Details are in the caption following the image
Comparison of secrecy capacity between different methods. The horizontal coordinate is the error rate of eavesdropping check, corresponding to the parameter p/2 in the depolarizing channel. Note the reception rates QB and QE are set to 1 in order to simplify the result. The capacity of the wiretap channel method is slightly larger than that of the entanglement distillation method at a low error rate but falls to zero rapidly as the error rate increases. The error rate threshold of the wiretap channel method is 0.086 while that of the entanglement distillation method is 0.110

3 SECURITY OF THE SINGLE-PHOTON QSDC PROTOCOL

Generally speaking, single-photon–based protocols are more practical than entanglement-based protocols. Therefore, we construct a generic single-photon–based QSDC protocol and prove its security through the equivalence between the two kinds of protocols.

Firstly, we need to construct an equivalent two-way entanglement-based protocol. The protocol works as follows: (1) Bob prepares the EPR pairs in state urn:x-wiley:que2:media:que226:que226-math-0020. (2) Bob sends each half of the pairs to Alice and does parameter estimation. (3) Alice applies encoding operation Uk on her halves and sends them to Bob. (4) Bob measures the pairs to decode. It is easy to find the equivalence between this two-way protocol and the original two-step protocol. Additionally, if Alice abandons dense coding and uses two operations, eg, I and σx, to encode the message, Bob simply needs to measure the two qubits separately to decode.

The generic two-way single-photon–based protocol is constructed as follows: (1) Bob prepares each qubit randomly in state urn:x-wiley:que2:media:que226:que226-math-0021 and sends them to Alice, where i∈{0,1} and urn:x-wiley:que2:media:que226:que226-math-0022 forms the basis of operator σj. (2) After Alice receives the qubits, they do parameter estimation by selecting some pairs randomly and measuring some observables such as σx or σz. (3) They sift out the qubits that cannot be effectively encoded by Alice. For example, if Alice is to apply Uk∈{I,σx} to encode, they sift out the qubits in σx basis since the states remain unchanged under σx operation. (4) Alice applies encoding operation Uk and sends them to Bob. (5) Bob measures the qubits in the basis in which they are prepared to decode.

Next, we prove the equivalence between the two protocols above. For the generic two-way single-photon–based protocol, Eve interacts with the qubits sent by Bob and gets the state urn:x-wiley:que2:media:que226:que226-math-0023. After the encoding operation of Alice, Eve intercepts all the qubits and gets the state urn:x-wiley:que2:media:que226:que226-math-0024. For the two-way entanglement-based protocol without dense coding, the state of the whole system after the interaction of Eve and the encoding of Alice is |ΦkABE=UkUAE|ψ⟩|E⟩. Then, Bob measures his qubits in basis σj. If the measurement result is urn:x-wiley:que2:media:que226:que226-math-0025, we can verify urn:x-wiley:que2:media:que226:que226-math-0026, neglecting the normalization factor.

Based on the equivalence, the lower bound of the secrecy capacity of the typical two-way single-photon–based QSDC protocol, ie, the DL04 protocol,4 can be obtained (see Appendix B for details)
urn:x-wiley:que2:media:que226:que226-math-0027()
where e is the bit error rate of the binary main channel. This capacity is the same as the previous result.26 However, a higher capacity can be reached if the eavesdropping checking part is modified. The modified DL04 protocol works as follows: (1) Bob prepares qubits urn:x-wiley:que2:media:que226:que226-math-0028 randomly in basis σx, σy, or σz and sends them to Alice. (2) Bob tells Alice which qubit is prepared in basis σy, then Alice measures those qubits in basis σy to get an error rate εy. (3) Alice applies encoding operation I,σy on the remaining qubits and sends them to Bob. (4) Bob measures the returned qubits in the basis in which he prepares them to decode. The lower bound of the secrecy capacity of this modified DL04 protocol is
urn:x-wiley:que2:media:que226:que226-math-0029()

The performance of DL04 protocol and modified DL04 protocol under lossless depolarizing channel is shown in Figure 3.

Details are in the caption following the image
Comparison of secrecy capacity between DL04 protocol and modified DL04 protocol under lossless depolarizing channel. The secrecy capacity of modified DL04 protocol is remarkably larger when the error rate is under the threshold. The error rate threshold of DL04 is 0.057 while that of modified DL04 is 0.079

In a general form, when they check the error rate in σu (u=x,y,z) basis and Alice uses {I,σu} as encoding operation, the secrecy capacity is Cs=QB[1−h(e)]−QEh(εu). Actually, the secrecy capacity is only constrained by the error rate of the corresponding basis of encoding operation.

4 CONCLUSION

We have applied the wiretap channel theory on security analysis of QSDC. The security of two-step protocol against coherent attack is proven with the secrecy capacity
urn:x-wiley:que2:media:que226:que226-math-0030()

Our analysis is completed under the following assumptions. (1) There exist noise and loss in the quantum channel. (2) The entanglement source and measurement device are perfect. (3) The EPR pairs transmitted in a round are infinite. Compared with the method of entanglement distillation, the error rate threshold based on the wiretap channel theory is slightly smaller. This result implies the superiority of quantum coding to some extent since one-way entanglement distillation is equivalent to quantum error correction code.34

Furthermore, we have established the equivalence between entanglement-based QSDC protocols and single-photon–based QSDC protocols, thus obtaining the secrecy capacity of the latter ones. Specifically, we have analyzed and modified the DL04 protocol to get a higher secrecy capacity
urn:x-wiley:que2:media:que226:que226-math-0031()

An in-depth analysis indicates that the eavesdropping capability of Eve can be fully described by the error rate in the basis of the encoding operator or, in other words, the phase error rate. The reason for the high performance of modified DL04 is that it can estimate Eve's eavesdropping capability more accurately.

The application of Wyner's wiretap channel theory to the security of QSDC provides a quantitative analysis of security for transmitting information deterministically. QSDC requires a forward coding scheme, which is different from QKD where only random numbers are transmitted. Forward coding has been studied in information theory, typical example was presented in the work of Tyagi and Vardy.30 As QSDC is the direct transmission of meaningful message rather than random strings, there exist potential wide applications in communication. The analysis presented here is a step toward the practical application of QSDC in realistic conditions.

ACKNOWLEDGEMENTS

This work was supported by China Aerospace Science and Technology Corporation; by the National Basic Research Program of China under grants 2017YFA0303700 and 2015CB921001; by the National Natural Science Foundation of China under grants 61727801, 61871257, and 11774197; and by the Key R&D Program of Guangdong Province under grant 2018B030325002. This work is supported in part by the Beijing Advanced Innovation Center for Future Chip (ICFC).

    APPENDIX A:

    THE DETAILED CALCULATION OF SECRECY CAPACITY OF TWO-STEP PROTOCOL

    Firstly, we calculate the upper bound of mutual information I(A:E). Remind that, in Equation 7, we have the average mutual information on one subsystem between Alice and Eve
    urn:x-wiley:que2:media:que226:que226-math-0032()
    Since pa is the distribution of each word, we can reasonably assume pa=1/4 for all a. Then, the Gram matrix method is used to calculate the entropy of urn:x-wiley:que2:media:que226:que226-math-0033 (refer to the work of Jozsa and Schlienz35 for Gram matrix method). The Gram matrix of urn:x-wiley:que2:media:que226:que226-math-0034 is symmetric
    urn:x-wiley:que2:media:que226:que226-math-0035
    where
    urn:x-wiley:que2:media:que226:que226-math-0036
    urn:x-wiley:que2:media:que226:que226-math-0037
    If we define
    urn:x-wiley:que2:media:que226:que226-math-0038
    the eigenvalues of Gram matrix G are
    urn:x-wiley:que2:media:que226:que226-math-0039
    Then, we have
    urn:x-wiley:que2:media:que226:que226-math-0040
    noting that εz=λ3+λ4,εx=λ2+λ4. This entropy reaches its maximum when C=AB.
    Similarly, we get the entropy of ρAE,a, ie, S(ρAE,a)=1 for all a. The upper bound on the mutual information between Alice and Eve is
    urn:x-wiley:que2:media:que226:que226-math-0041()
    The capacity of wiretap channel satisfies
    urn:x-wiley:que2:media:que226:que226-math-0042
    If we assume the main channel is a quaternary symmetric channel, the capacity of the main channel is
    urn:x-wiley:que2:media:que226:que226-math-0043()
    where e is the error rate distribution of the main channel. The lower bound of the secrecy capacity of two-step protocol is
    urn:x-wiley:que2:media:que226:que226-math-0044
    Considering the channel loss, it becomes
    urn:x-wiley:que2:media:que226:que226-math-0045()

    APPENDIX B:

    THE DETAILED CALCULATION OF THE SECRECY CAPACITY OF DL04 PROTOCOL AND MODIFIED DL04 PROTOCOL

    In the entanglement version of modified DL04 protocol, there are two encoded states
    urn:x-wiley:que2:media:que226:que226-math-0046
    Similarly, the Gram matrix method is used to calculate the entropy of urn:x-wiley:que2:media:que226:que226-math-0047, where pa=1/2 for all a. The Gram matrix is
    urn:x-wiley:que2:media:que226:que226-math-0048
    Noticing that λ1λ2λ3+λ4=1−2εy, the eigenvalues of the Gram matrix are
    urn:x-wiley:que2:media:que226:que226-math-0049
    It is easy to get the entropy urn:x-wiley:que2:media:que226:que226-math-0050. Then, we have the mutual information
    urn:x-wiley:que2:media:que226:que226-math-0051
    and secrecy capacity of modified DL04 protocol
    urn:x-wiley:que2:media:que226:que226-math-0052()
    where 1−h(e) is the main channel capacity.
    For DL04 protocol, the only difference is that the parameters acquired in the eavesdropping checking process are εx and εz instead of εy. Hence, we need to estimate the upper bound of εy through εx and εz. According to the constraint
    urn:x-wiley:que2:media:que226:que226-math-0053()
    the worst situation is λ4=0, then we have urn:x-wiley:que2:media:que226:que226-math-0054. The secrecy capacity of DL04 protocol is obtained by substituting this result into Equation B1
    urn:x-wiley:que2:media:que226:que226-math-0055()

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.