IEEE Transactions on Signal Processing

Total Secrecy From Anti-Eavesdropping Channel Estimation

Shuo Wu, Yingbo Hua

Published Jan 1, 2022• 8 citations

Abstract

Anti-eavesdropping channel estimation (ANECE) is useful for a network of cooperative full-duplex radio devices/users. Using ANECE, a secret key can be generated by each pair of users, and additional secret information can be transmitted between a pair of users. This paper analyzes the capacity of the secret key based on ANECE, and compares it with the conventional method for channel training. The paper also analyzes the secrecy capacity of information transmission using an one-way scheme, and compares it with a two-way scheme. It is shown that the total amount of secrecy generated from ANECE can be substantially larger than that based on the conventional method especially when an eavesdropper may have an unlimited number of antennas. The paper also formulates a total secure degree of freedom (TSDoF) of the ANECE based scheme, and compares it with a prior scheme of secret information transmission from a multi-antenna node to another against a multi-antenna eavesdropper where channel state information is unknown everywhere initially. The comparison shows that there is a substantial gain of TSDoF by exploiting full-duplex radios and reciprocal channels via ANECE. Most of the key insights are highlighted in twelve proven properties.

DOI: 10.1109/tsp.2022.3145676

Related papers

Secure Degree of Freedom of Wireless Networks Using Collaborative Pilots

Yingbo Hua, Qingpeng Liang, Md Saydur Rahman

A wireless network of full-duplex nodes/users, using anti-eavesdropping channel estimation (ANECE) based on collaborative pilots, can yield a positive secure degree-of-freedom (SDoF) regardless of the number of antennas an eavesdropper may have. This paper presents novel results on SDoF of ANECE by analyzing secret-key capacity (SKC) of each pair of nodes in a network of multiple collaborative nodes per channel coherence period. Each transmission session of ANECE has two phases: phase 1 is used for pilots, and phase 2 is used for random symbols. This results in two parts of SDoF of ANECE. Both lower and upper bounds on the SDoF of ANECE for any number of users are shown, and the conditions for the two bounds to meet are given. This leads to important discoveries, including: a) The phase-1 SDoF is the same for both multi-user ANECE and pair-wise ANECE while the former may require only a fraction of the number of time slots needed by the latter; b) For a three-user network, the phase-2 SDoF of all-user ANECE is generally larger than that of pair-wise ANECE; c) For a two-user network, a modified ANECE deploying square-shaped nonsingular pilot matrices yields a higher total SDoF than the original ANECE. The multi-user ANECE and the modified two-user ANECE shown in this paper appear to be the best full-duplex schemes known today in terms of SDoF subject to each node using a given number of antennas for both transmitting and receiving.

arXiv:2309.12502IEEE Transactions on Signal ProcessingJan 1, 20235 citations

Anti-Eavesdropping Channel Estimation Using Multi-Antenna Half-Duplex Radios

Yingbo Hua

This paper reviews the basic principles of prior methods for the purpose of wireless anti-eavesdropping channel estimation (ANECE), and highlights their major shortcomings and limitations such as failure for carrier synchronization without a pilot and limited transmission range of a full-duplex radio. This paper also proposes and analyses a new scheme of ANECE using multi-antenna half-duplex radios. This new scheme consists of three phases of transmissions between two radio nodes (Alice and Bob). In phase 1, Bob sends out a pilot via one of his antennas so that Alice can carry out carrier synchronization and channel estimation. In phase 2, Alice sends out a pilot via one of her antennas so that Bob can carry out carrier synchronization and channel estimation. In phase 3, perfectly synchronized with phase 2, Alice applies transmit beamforming and sends out a stream of information via all her other antennas. This new scheme of ANECE for multi-antenna half-duplex radios is derived from an ANECE design for antenna-isolation based full-duplex radios.

IEEE Military Communications Conference (MILCOM)Nov 29, 20211 citation

Advanced Properties of Full-Duplex Radio for Securing Wireless Network

Yingbo Hua

This paper examines the role of full-duplex radio for securing wireless network from a new perspective. It first studies the secrecy capacity of two single-antenna full-duplex users against a multi-antenna eavesdropper (Eve) who has the perfect knowledge of the channel state information (CSI) from users to Eve. It is shown that if Eve uses a basic matched-filtering, the probability of zero secrecy (or outage) can be made small by a large jamming power from both users and a small gain of residual self-interference (RSI) power. But if Eve uses the optimal matched-filtering, the probability of outage grows rapidly as either the jamming power from the users increases or the number of antennas on Eve increases, regardless of the RSI gain. To prevent any Eve from obtaining its CSI, this paper then proposes a novel anti-eavesdropping channel estimation (ANECE) method, which allows users to obtain their own CSI while keeping all Eves in handicap. This method also prevents Eves from colluding with each other at any layer. The design of ideal pilots for ANECE for multiple multi-antenna users and multiple broadband multi-antenna users is discussed. It is also shown that the capacity of Eve with any number of antennas but without its CSI can be virtually eliminated over a time window corresponding to the number of antennas at the transmitter for each realization of the CSI.

IEEE Transactions on Signal ProcessingNov 6, 201829 citations

Secrecy Throughput of ANECE Assisted Transmission of Information in Finite Blocklength

Ishmam Zabir, Ananthram Swami, Yingbo Hua

Anti-eavesdropping channel estimation (ANECE) among two or more cooperative full-duplex radio devices allows these devices to obtain consistent estimates of their receive channel state information (CSI) with respect to each other but at the same time prevents eavesdropper (Eve) from obtaining a consistent estimate of its receive CSI, which improves the secrecy of subsequent transmission of information between the devices. This paper presents an analysis of secrecy throughput of ANECE assisted transmission of information between such single-antenna devices against Eve with multiple antennas. The analysis is based on finite blocklength coding and assumes that Eve applies a standard approach for information detection. Easy-to-compute analytical expressions of secrecy throughput in terms of various controllable parameters are obtained. Numerical results are presented and discussed.

IEEE Wireless Communications and Networking ConferenceApr 10, 20221 citation

Secrecy Throughput Enhancement with ANECE and Multi-Antenna Beamforming in Finite Blocklength

Ishmam Zabir, Ananthram Swami, Yingbo Hua

This paper presents a secure downlink communication system where a transmitter with multiple antennas sends information to multiple single antenna users under ultra reliable and low-latency communication (uRLLC) system requirement. To meet uRLLC requirement and provide secrecy against multi-antenna eavesdropper (Eve), transmitter adopts a special channel training scheme called anti-eavesdropping channel estimation (ANECE) as well as a standard transmit beamforming to send secret information in short blocklength regime. Using ANECE, two or more cooperative full-duplex radio devices obtain their receive channel state information (CSI) with respect to each other while preventing Eve from obtaining a consistent estimate of its receive CSI, which improves the secrecy of subsequent transmission of information between the devices. We derive an expression for the average secrecy throughput (AST) of ANECE assisted transmission. This easy-to-evaluate expression of approximated AST in terms of blocklength and various controllable parameters leads to useful insights to maximize AST under uRLLC requirement. Finally, numerical results are presented and discussed.

International Conference on CommunicationsMay 16, 20221 citation

Physical Layer Security with Full-Duplex Radio in Wireless Networks

Qiping Zhu

Physical layer security (PLS) is an approach that provides secrecy based on information-theoretic model which does not account for any computation capability assumption or pre-installed standardized secret key generation algorithm and it is a good additional protection on the top of the existing security scheme. This work includes four different topics which are about improving PLS with full-duplex radio. In the first topic, we develop a fast algorithms for computing power allocations in subcarriers, subject to power and rate constraints, to maximize the secrecy capacity of a three-node network consisting of a source, a full-duplex capable destination and an eavesdropper. The optimal power allocation at the destination is found to be significant especially when its power budget is high. The second topic is about the analysis of a two-phase scheme for secret information transmission with the technique of anti-eavesdropping channel estimation (ANECE), which requires full duplex transceiver and it can better handle Eve with any number of antennas. The analysis is based on the assumption that everyone has a prior statistical knowledge of the channel state information (CSI) anywhere and it yields lower and upper bounds on secure degrees of freedom as functions of the number of antennas on Eve and the size of information packet. For the third topic, we present optimal designs of the pilots for ANECE based on two criteria. The first is to optimize the minimum mean squared error (MMSE) channel estimation for the users, and the second is to maximize the mutual information between the pilot-driven signals observed by the users. Closed-form optimal pilots are shown under both criteria but subject to a symmetric and isotropic condition. Algorithms for computing the optimal pilots are shown for general cases. In the fourth topic, we analyze the secure degree of freedom and the asymptotic expression of the achievable secret key rate from a two-phase key generation scheme which consists of channel training phase and secure information transmission phase. Based on the asymptotic form, we develop an effective algorithm for coherence time allocation between the two phases to maximize the achievable secret key rate.

Jan 1, 20190 citations