Time for secrecy

Te Sun Han, Hiroyuki Endo, Masahide Sasaki

The coding problem for wiretap channels with causal state information available at the encoder is studied. In particular, we address the wiretap channel only with one-time state information (instead of the usual causal state information up to present) in the sense that the one-time encoder uses only the current state information Sk at each time k to establish the secrecy capacity formula under the δ-strong secrecy criterion. The coding problem for wiretap channels with one-time channel state information available at the encoder under cost constraints is also studied and lower bounds on the “δ-strong” secrecy capacity given cost are also demonstrated.

S. A. Goudsmit

David Gevaux

Xiaoming Liu, Bin Li, Feng Zhao

A closed‐form expression of the achievable secrecy rate is derived in this study, which is used as the objective function to find the optimal time allocation of channel estimation and transmission. Theory analysis and numerical results demonstrate that the maximum secrecy capacity depends on the total time budget as well as the power at the transmitter.

Roohollah Rezaei, Sumei Sun, Xin Kang +2 more

In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first aim to optimize the sum secrecy throughput of the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The optimization problem is shown to be nonconvex. To tackle the problem, we propose a suboptimal two stage approach, referred to as sum secrecy throughput maximization (SSTM). In the first stage, the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during information transmission time slots. Then, the optimal beamforming vector in the initial noninformation transmission time slot and the optimal time slots are derived. We then consider secrecy throughput fairness among the nodes and propose max-min fair (MMF) and proportional fair (PF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PF achieves a good tradeoff between the sum secrecy throughput and fairness among the nodes. Through the numerical simulations, we first demonstrate the superior performance of the SSTM to uniform time slotting and beamforming in different settings. Then, we show the effectiveness of MMF and PF algorithms.

Merle Colby, David A. Katcher