SearcharxivSearch

arXiv subjects

Yingbo Hua

Publications and source records attributed to Yingbo Hua.

At least 19 recordsLinked to original sources

Optimization of MIMO STEEP for Secure Communications over MIMOME Channels

A transmission scheme for secure communications, called secret-message transmission by echoing encrypted probes (STEEP), can deliver a positive secrecy rate, even when eavesdropping channels are much stronger than that between users, subject to sufficient asymmetric power allocations from users. This paper considers an optimization problem for STEEP applied to MIMO (or MIMOME) channels between multi-antenna users and multi-antenna Eve. We reveal for the first time a significant increase of the achievable secrecy rate of MIMO STEEP using optimized precoders.

cs.IT

Investigation of STEEP for Secure Communications Over SIMO and MISO Channels Subject to Full-Duplex Jamming and Eavesdropping

Secure communications over SIMO and MISO channels between wireless nodes are commonly encountered in applications and widely considered in the literature. This paper investigates such a problem by considering a newly proposed scheme called secrecy-message transmission by echoing encrypted probes (STEEP). We focus on a type of heavily eavesdropped channels where an aggressive eavesdropper (Eve) has multiple antennas and is capable of jamming and eavesdropping in the full-duplex mode. Assuming optimal jamming and eavesdropping by Eve, we present the secrecy rates achievable by STEEP in two forms: using SIMO channel in phase 1 and using MISO channel in phase 2, and vice versa. With any given channel condition between every pair of nodes and any finite jamming power by Eve, the secrecy rate of STEEP in either form is shown to be positive subject to a positive power in phase 1 and a sufficiently large power in phase 2. The connections between STEEP in either form and the conventional SIMO and MISO schemes are provided, and their secrecy rates are compared comprehensively subject to random fading channels and finite transmit powers.

cs.IT

A Remark on the AAA Method for Secret-Key Generation in Mobile Networks

A broadly applicable method for secret-key generation is named for its accumulative, adaptable and additive (AAA) properties. This paper first shows a robustness of its performance. Namely, even if there is an inter correlation or a leakage caused intra correlation among the superimposed packets, provided there is a nonzero probability for each packet to be missed in full or in part by Eve, then the equivocation of the key generated by the AAA method always becomes perfect as the number of superpositions becomes infinite. Also shown in this paper is a comparison between the AAA method and an ideal method based on reciprocal channel estimation, which reveals several advantages of the AAA method.

eess.SP

STEEP -- An Alternative To Quantum Key Distribution

Secret-message transmission by echoing encrypted probes (STEEP) is discussed as an alternative to quantum key distribution (QKD). The former only needs classic or non-quantum channels while the latter needs both quantum and classic channels for secret-key generation. STEEP is shown to yield a secrecy rate sufficient for one-time pads encryption in many practical situations including in-air channels or undersea optical cables. Other advantages of STEEP over QKD include cost, complexity, compatibility, and robustness against constant eavesdropping.

eess.SP

On Secret-Message Transmission by Echoing Encrypted Probes

A scheme for secure communications, called ``Secret-message Transmission by Echoing Encrypted Probes (STEEP)'', is revisited. STEEP is a round-trip scheme with a probing phase from one user to another and an echoing phase in the reverse direction. STEEP is shown to be broadly applicable to yield a positive secrecy rate in bits per channel use even if the receive channels at eavesdropper (Eve) are stronger than those between legitimate users in both forward and reverse directions. This paper focuses on STEEP in the following settings: using Gaussian probing signal and Gaussian linear encryption over MIMO Gaussian channel (G-STEEP); using phase-shift-keying probing signal and a nonlinear encryption over SISO channel (P-STEEP); and a variation of G-STEEP for multiple access communication (M-STEEP). In each of the settings, Eve is assumed to have any given number of antennas, and STEEP is shown to yield a positive secrecy rate subject to a sufficiently large power in the echoing phase, as long as Eve's receive channel in the probing phase is not noiseless. It is also shown that G-STEEP, subject to asymmetric large powers in forward and reverse directions, has its secrecy rate approaching the secret-key capacity based on Gaussian probing signal over MIMO Gaussian channel. STEEP does not require secure feedback channel, collaborative third party, in-band full-duplex or reciprocal channels between users, but only needs a design for echoing encrypted probes, asymmetric power allocation and/or collaborative round-trip coding.

eess.SP

A Simple Method for Secret-Key Generation Between Mobile Users Across Networks

Two or more mobiles users can continuously superimpose sequences of bits chosen from different packets or files already exchanged and authenticated between themselves to continuously renew a secret key for continuous strengthening of their privacy and authentication. This accumulative, adaptable and additive (AAA) method is discussed in this paper. The equivocation to Eve of any bit in the generated key by the AAA method equals to the probability that not all corresponding independent bits exchanged between the users are intercepted by Eve. This performance, achieved without using any knowledge of non-stationary probabilities of bits being intercepted by Eve, is compared to an established capacity achievable using that knowledge. A secrecy robustness of the AAA method against some correlations known to Eve is also discussed.

cs.CR

Unification of Secret Key Generation and Wiretap Channel Transmission

This paper presents further insights into a recently developed round-trip communication scheme called ``Secret-message Transmission by Echoing Encrypted Probes (STEEP)''. A legitimate wireless channel between a multi-antenna user (Alice) and a single-antenna user (Bob) in the presence of a multi-antenna eavesdropper (Eve) is focused on. STEEP does not require full-duplex, channel reciprocity or Eve's channel state information, but is able to yield a positive secrecy rate in bits per channel use between Alice and Bob in every channel coherence period as long as Eve's receive channel is not noiseless. This secrecy rate does not diminish as coherence time increases. Various statistical behaviors of STEEP's secrecy capacity due to random channel fading are also illustrated.

cs.IT

Secret-Key Capacity from MIMO Channel Probing

Revealing expressions of secret-key capacity (SKC) based on data sets from Gaussian MIMO channel probing are presented. It is shown that Maurer's upper and lower bounds on SKC coincide when the used data sets are produced from one-way channel probing. As channel coherence time increases, SKC in bits per probing channel use is always lower bounded by a positive value unless eavesdropper's observations are noiseless, which is unlike SKC solely based on reciprocal channels.

cs.IT

Secret-Message Transmission by Echoing Encrypted Probes -- STEEP

This paper examines the properties of the lower and upper bounds established by Maurer, Ahlswede and Csiszar (MAC) for secret-key capacity in the case of channel probing over single-input and single-output (SISO) channels. Inspired by the insights into MAC's bounds, a scheme called secret-message transmission by echoing encrypted probes (STEEP) is proposed. STEEP consists of two phases: in phase 1, Alice sends random probes over a probing channel to Bob; in phase 2, Bob echoes back an estimated version of the probes, but encrypted by a secret, over a high-quality return channel. Provided that Eve is unable to obtain the exact probes transmitted by Alice in phase 1, STEEP guarantees a positive secrecy rate from Bob to Alice over the return channel even if Eve's channel strength during channel probing is stronger than Bob's. STEEP is applicable to both physical layer and upper layers in connected networks.

cs.IT

Secure Degree of Freedom of Wireless Networks Using Collaborative Pilots

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.

cs.IT

Continuous Encryption Functions for Security Over Networks

This paper presents a study of continuous encryption functions (CEFs) of secret feature vectors for security over networks such as physical layer encryption for wireless communications and biometric template security for online Internet applications. CEFs are defined to include all prior continuous "one-way" functions. It is shown that dynamic random projection and index-of-max (IoM) hashing algorithm 1 are not hard to attack, IoM algorithm 2 is not as hard to attack as it was thought to be, and higher-order polynomials are easy to attack via substitution. Also presented is a new family of CEFs based on selected components of singular value decomposition (SVD) of a randomly modulated matrix of feature vector. Detailed empirical evidence suggests that SVD-CEF is hard to attack. Statistical analysis of SVD-CEF reveals its useful properties including its sensitivity to noise. The bit-error-rate performance of a quantized SVD-CEF is shown to exceed that of IoM algorithm 2.

cs.CR

Secrecy of Multi-Antenna Transmission with Full-Duplex User in the Presence of Randomly Located Eavesdroppers

This paper considers the secrecy performance of several schemes for multi-antenna transmission to single-antenna users with full-duplex (FD) capability against randomly distributed single-antenna eavesdroppers (EDs). These schemes and related scenarios include transmit antenna selection (TAS), transmit antenna beamforming (TAB), artificial noise (AN) from the transmitter, user selection based their distances to the transmitter, and colluding and non-colluding EDs. The locations of randomly distributed EDs and users are assumed to be distributed as Poisson Point Process (PPP). We derive closed form expressions for the secrecy outage probabilities (SOP) of all these schemes and scenarios. The derived expressions are useful to reveal the impacts of various environmental parameters and user's choices on the SOP, and hence useful for network design purposes. Examples of such numerical results are discussed.

cs.IT

A Research Journey of Full-Duplex at University of California from Self-Interference Cancellation to Wireless Network Security

This article provides an overview of research on full-duplex at the University of California, Riverside, in the past decade. This research was initially focused on self-interference (SI) cancellation, then moved to applications of full-duplex to improve network spectral efficiency, and in recent years advanced to discover full-duplex's potentials for wireless network security. The research on SI cancellation has resulted in both hardware-based SI cancellation results and some advanced theoretical architectures which show promises but are yet to be tested via advanced hardware implementations. The applications of full-duplex for optimized spectral efficiency in ad hoc, cognitive and cellular networks have shown how to optimize power allocation among full-duplex nodes, in their antenna beamspace and over multiple subcarriers. Full-duplex has also been found to be highly beneficial for improving secrecy capacity between legitimate users against eavesdropping. Among the new capabilities that full-duplex provides for network security is an effective anti-eavesdropping channel estimation scheme which is not possible for nodes without full-duplex.

eess.SP

Optimal Pilots for Anti-Eavesdropping Channel Estimation

Anti-eavesdropping channel estimation (ANECE) is a method that uses specially designed pilot signals to allow two or more full-duplex radio devices each with one or more antennas to estimate their channel state information (CSI) consistently and at the same time prevent eavesdropper (Eve) with any number of antennas from obtaining its CSI consistently. This paper presents optimal designs of the pilots for ANECE based on two criteria. The first is the mean squared error (MSE) of channel estimation for the users, and the second is the mutual information (MI) between the pilot-driven signals observed by the users. Closed-form optimal pilots are shown under the sum-MSE and sum-MI criteria subject to a symmetric and isotropic condition. Algorithms for computing the optimal pilots are shown for general cases. Fairness issues for three or more users are discussed. The performances of different designs are compared.

eess.SP

Secrecy Analyses of a Full-Duplex MIMOME Network

This paper presents secrecy analyses of a full-duplex MIMOME network which consists of two full-duplex multi-antenna users (Alice and Bob) and an arbitrarily located multi-antenna eavesdropper (Eve). The paper assumes that Eve's channel state information (CSI) is completely unknown to Alice and Bob except for a small radius of secured zone. The first part of this paper aims to optimize the powers of jamming noises from both users. To handle Eve's CSI being unknown to users, the focus is placed on Eve at the most harmful location, and the large matrix theory is applied to yield a hardened secrecy rate to work on. The performance gain of the power optimization in terms of maximum tolerable number of antennas on Eve is shown to be significant. The second part of this paper shows two analyses of anti-eavesdropping channel estimation (ANECE) that can better handle Eve with any number of antennas. One analysis assumes that Eve has a prior statistical knowledge of its CSI, which yields lower and upper bounds on secure degrees of freedom of the system as functions of the number (N) of antennas on Eve and the size (K) of information packet. The second analysis assumes that Eve does not have any prior knowledge of its CSI but performs blind detection of information, which yields an approximate secrecy rate for the case of K being larger than N.

eess.SP

Fundamental Properties of Full-Duplex Radio for Secure Wireless Communications

This paper presents a number of fundamental properties of full-duplex radio for secure wireless communication under some simple and practical conditions. In particular, we consider the fields of secrecy capacity of a wireless channel between two single-antenna radios (Alice and Bob) against an unknown number of single-antenna eavesdroppers (Eves) from unknown locations, where Alice and Bob have zero knowledge (except a model) of the large-scale-fading channel-state-information of Eves. These properties show how the secrecy capacity is distributed in terms of the location of any Eve, how the optimal jamming power applied by the full-duplex radio varies with various parameters, and how bad or good the worst cases are. In particular, these properties show how the quality of self-interference cancelation/suppression affects various aspects of the fields of secrecy capacity. The cases of colluding Eves and non-colluding Eves are treated separately and yet coherently. For non-colluding Eves, asymptotically constant fields of secrecy capacity are revealed. For each of the two cases, we also treat subcases with or without small-scale fading.

cs.IT

High-Rate Space Coding for Reconfigurable 2x2 Millimeter-Wave MIMO Systems

Millimeter-wave links are of a line-of-sight nature. Hence, multiple-input multiple-output (MIMO) systems operating in the millimeter-wave band may not achieve full spatial diversity or multiplexing. In this paper, we utilize reconfigurable antennas and the high antenna directivity in the millimeter-wave band to propose a rate-two space coding design for 2x2 MIMO systems. The proposed scheme can be decoded with a low complexity maximum-likelihood detector at the receiver and yet it can enhance the bit-error-rate performance of millimeter-wave systems compared to traditional spatial multiplexing schemes, such as the Vertical Bell Laboratories Layered Space-Time Architecture (VBLAST). Using numerical simulations, we demonstrate the efficiency of the proposed code and show its superiority compared to existing rate-two space-time block codes.

cs.IT

High Rate/Low Complexity Space-Time Block Codes for 2x2 Reconfigurable MIMO Systems

In this paper, we propose a full-rate full-diversity space-time block code (STBC) for 2x2 reconfigurable multiple-input multiple-output (MIMO) systems that require a low complexity maximum likelihood (ML) detector. We consider a transmitter equipped with a linear antenna array where each antenna element can be independently configured to create a directive radiation pattern toward a selected direction. This property of transmit antennas allow us to increase the data rate of the system, while reducing the computational complexity of the receiver. The proposed STBC achieves a coding rate of two in a 2x2 MIMO system and can be decoded via an ML detector with a complexity of order M, where M is the cardinality of the transmitted symbol constellation. Our simulations demonstrate the efficiency of the proposed code compared to existing STBCs in the literature.

cs.IT