Secure Polar Coding for the Primitive Relay Wiretap Channel

With the emergence of wireless networks, cooperation for secrecy is recognized as an attractive way to establish secure communications. Departing from cryptographic techniques, secrecy can be provided by exploiting the wireless channel characteristics; that is, some error-correcting codes besides reliability have been shown to achieve information-theoretic security. In this paper, we propose a polar-coding-based technique for the primitive relay wiretap channel and show that this technique is suitable to provide information-theoretic security. Specifically, we integrate at the relay an additional functionality, which allows it to smartly decide whether it will cooperate or not based on the decoding detector result. In the case of cooperation, the relay operates in a decode-and-forward mode and assists the communication by transmitting a complementary message to the destination in order to correctly decode the initial source’s message. Otherwise, the communication is completed with direct transmission from source to the destination. Finally, we first prove that the proposed encoding scheme achieves weak secrecy, then, in order to overcome the obstacle of misaligned bits, we implement a double-chaining construction, which achieves strong secrecy.     

Deterministic Quantum Secure Direct Communication with Dense Coding and Continuous Variable Operations

We propose a deterministic quantum secure direct two check photon sequences are used to check the securities of the communication protocol by using dense coding. The channels between the message sender and the receiver. The continuous variable operations instead of the usual discrete unitary operations are performed on the travel photons so that the security of the present protocol can be enhanced. Therefore some specific attacks such as denial-of-service attack, intercept-measure-resend attack and invisible photon attack can be prevented in ideal quantum channel. In addition, the scheme is still secure in noise channel. Furthurmore, this protocol has the advantage of high capacity and can be realized in the experiment.     

Revisiting Controlled Quantum Secure Direct Communication Using a Non-symmetric Quantum Channel with Quantum Superdense Coding

Recently Xia and Song [Phys. Lett. A 364 （2007） 117] have proposed a controlled quantum secure direct communication （CQSDC） protocol. They claimed that in their protocol only with the help of the controller Charlie, the receiver Alice can successfully extract the secret message from the sender Bob. In this letter, first we will show that within their protocol the controller Charlie＇s role could have been excluded if it were not for their unreasonable design. We then revise the Xia-Song CQSDC protocol such that its original advantages are reta/ned and the CQSDC can be really realized.     

Quantum Network Coding on Networks with Arbitrarily Distributed Hidden Channels

Although perfect quantum network coding has been proved to be achievable,it is still puzzling whether it is feasible whenever one or more of the channels are replaced by the hidden ones emerging from quantum entanglement.The question is answered in this paper.First,we propose a quantum network coding protocol over a butterfly network with two hidden channels.Second,we investigate a more general situation,where d-level quantum letters are transmitted through the network containing arbitrarily distributed hidden channels,and prove that quantum network coding on such networks is still achievable.     

Quantum Network Coding on Networks with Arbitrarily Distributed Hidden Channels

Although perfect quantum network coding has been proved to be achievable, it is still puzzling whether it is feasible whenever one or more of the channels are replaced by the hidden ones emerging from quantum entanglement. The question is answered in this paper. First, we propose a quantum network coding protocol over a butterfly network with two hidden channels. Second, we investigate a more general situation, where d-level quantum letters are transmitted through the network containing arbitrarily distributed hidden channels, and prove that quantum network coding on such networks is still achievable.     

一种基于诱骗态的广域量子安全直接通信网络方案

提出了一种基于诱骗态的广域量子安全直接通信网络方案.在每一个局域网中设置一个服务器负责量子态的产生和测量,从而提高了通信距离;将诱骗态的思想引入量子安全直接通信,采用不同的强度发送光脉冲,能够克服光子数目分割攻击,从而提高通信的安全性;根据信道参量估计了不同通信距离的通过率,为信道编码提供了依据.对所提方案进行了安全性分析,结果表明此方案能够实现远距离量子安全直接通信.     

Bidirectional Quantum Secure Direct Communication Network Protocol with Hyperentanglement

We propose a bidirectional quantum secure direct communication (QSDC) network protocol with the hyperentanglment in both the spatial-mode ad the polarization degrees of freedom of photon pairs which can in principle be produced with a beta barium borate crystal. The secret message can be encoded on the photon pairs with unitary operations in these two degrees of freedom independently. Compared with other QSDC network protocols, our QSDC network protocol has a higher capacity as each photon pair can carry 4 bits of information. Also, we discuss the security of our QSDC network protocol and its feasibility with current techniques.     

Unconditional Authentication Based on Physical Layer Offered Chain Key in Wireless Communication

Authentication is a critical issue in wireless communication due to the impersonation and substitution attacks from the vulnerable air interface launched by the malicious node. There are currently two kinds of authentication research in wireless communication. One is based on cryptography and relies on computational complexity, the other is based on physical layer fingerprint and can not protect data integrity well. Both of these approaches will become insecure when facing attackers with infinite computing power. In this paper, we develop a wireless unconditional authentication framework based on one-time keys generated from wireless channel. The proposed unconditional authentication framework provides a new perspective to resist infinite computing power attackers. We study the performance of the unconditional authentication framework in this paper. First, a physical layer offered chain key (PHYLOCK) structure is proposed, which can provide one-time keys for unconditional authentication. The physical layer offered chain keys are generated by XORing the physical layer updated keys extracted from the current channel state information (CSI) and the previous chain keys. The security of PHYLOCK is analyzed from the perspective of information theory. Then, the boundary of the deception probability is conducted. It is shown that unconditional authentication can achieve a probability of deception 2−12Hk, where Hk is the entropy of the one-time key used for one message. Finally, the conditions for unconditional authentication are listed. Our analysis shows that the length of the key and the authentication code need to be twice the length of the message and the encoding rules of the authentication code need to satisfy the restrictions we listed.     

Protecting Physical Layer Secret Key Generation from Active Attacks

Lightweight session key agreement schemes are expected to play a central role in building Internet of things (IoT) security in sixth-generation (6G) networks. A well-established approach deriving from the physical layer is a secret key generation (SKG) from shared randomness (in the form of wireless fading coefficients). However, although practical, SKG schemes have been shown to be vulnerable to active attacks over the initial “advantage distillation” phase, throughout which estimates of the fading coefficients are obtained at the legitimate users. In fact, by injecting carefully designed signals during this phase, a man-in-the-middle (MiM) attack could manipulate and control part of the reconciled bits and thus render SKG vulnerable to brute force attacks. Alternatively, a denial of service attack can be mounted by a reactive jammer. In this paper, we investigate the impact of injection and jamming attacks during the advantage distillation in a multiple-input–multiple-output (MIMO) system. First, we show that a MiM attack can be mounted as long as the attacker has one extra antenna with respect to the legitimate users, and we propose a pilot randomization scheme that allows the legitimate users to successfully reduce the injection attack to a less harmful jamming attack. Secondly, by taking a game-theoretic approach we evaluate the optimal strategies available to the legitimate users in the presence of reactive jammers.     

Generic security analysis framework for quantum secure direct communication

Quantum secure direct communication provides a direct means of conveying secret information via quantum states among legitimate users. The past two decades have witnessed its great strides both theoretically and experimentally. However, the security analysis of it still stays in its infant. Some practical problems in this field to be solved urgently, such as detector efficiency mismatch, side-channel effect and source imperfection, are propelling the birth of a more impeccable solution. In this paper, we establish a new framework of the security analysis driven by numerics where all the practical problems may be taken into account naturally. We apply this framework to several variations of the DL04 protocol considering real-world experimental conditions. Also, we propose two optimizing methods to process the numerical part of the framework so as to meet different requirements in practice. With these properties considered, we predict the robust framework would open up a broad avenue of the development in the field.