Asilomar Conference on Signals, Systems and Computers (ACSSC)

Everlasting secrecy in disadvantaged wireless environments against sophisticated eavesdroppers

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik

Published Nov 1, 2014• 5 citations

Abstract

Secure communication over a wireless channel in the presence of a passive eavesdropper is considered. Our main interest is in the disadvantaged wireless environment, where the channel from the transmitter Alice to the eavesdropper Eve is (possibly much) better than that from Alice to Bob, hence making information-theoretic secrecy challenging. We present a method to exploit inherent vulnerabilities of the eavesdropper's receiver through the use of “cheap” cryptographically-secure key-bits, which only need be kept secret from Eve for the (short) transmission period of the message, to obtain information-theoretic (i.e. everlasting) secret bits at Bob. In particular, based on an ephemeral cryptographic key pre-shared between Alice and Bob, a random jamming signal with large variations is added to each symbol. The legitimate receiver Bob uses the key to subtract the jamming signal immediately, while Eve is forced to perform the inherently nonlinear operation of recording the signal; when Eve then obtains the key, which we assume pessimistically (for Alice) happens right after message transmission, Eve can then immediately subtract the jamming signal from the recorded signal. But, because of the intervening non-linear operation in Eve's receiver and the non-commutativity of nonlinear operations, Bob's channel and Eve's channel have different achievable rates and information-theoretic secrecy can be obtained, hence achieving the goal of converting the vulnerable cryptographic secret key into information-theoretic secure bits. The achievable secrecy rates for different settings are evaluated. Among other results, it is shown that, even when the eavesdropper has perfect access to the output of the transmitter (albeit through an imperfect analog-to-digital converter), the method can still achieve a positive secrecy rate.

DOI: 10.1109/acssc.2014.7094820

Related papers

Jamming Based on an Ephemeral Key to Obtain Everlasting Security in Wireless Environments

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik

Secure communication over a wiretap channel is considered in the disadvantaged wireless environment, where the eavesdropper channel is (possibly much) better than the main channel. We present a method to exploit inherent vulnerabilities of the eavesdroppers receiver to obtain everlasting secrecy. Based on an ephemeral cryptographic key pre-shared between the transmitter Alice and the intended recipient Bob, a random jamming signal is added to each symbol. Bob can subtract the jamming signal before recording the signal, while the eavesdropper Eve is forced to perform these non-commutative operations in the opposite order. Thus, information-theoretic secrecy can be obtained, hence achieving the goal of converting the vulnerable “cheap” cryptographic secret key bits into “valuable” information-theoretic (i.e., everlasting) secure bits. We evaluate the achievable secrecy rates for different settings, and show that, even when the eavesdropper has perfect access to the output of the transmitter (albeit through an imperfect analog-to-digital converter), the method can still achieve a positive secrecy rate. Next we consider a wideband system, where Alice and Bob perform frequency hopping in addition to adding the random jamming to the signal, and we show the utility of such an approach even in the face of substantial eavesdropper hardware capabilities.

arXiv:1412.6014IEEE Transactions on Wireless CommunicationsJun 22, 201516 citations

Everlasting Secrecy by Exploiting Non-Idealities of the Eavesdropper's Receiver

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik

Secure communication over a memoryless wiretap channel in the presence of a passive eavesdropper is considered. Traditional information-theoretic security methods require an advantage for the main channel over the eavesdropper channel to achieve a positive secrecy rate, which in general cannot be guaranteed in wireless systems. Here, we exploit the non-linear conversion operation in the eavesdropper's receiver to obtain the desired advantage - even when the eavesdropper has perfect access to the transmitted signal at the input to their receiver. The basic idea is to employ an ephemeral cryptographic key to force the eavesdropper to conduct two operations, at least one of which is non-linear, in a different order than the desired recipient. Since non-linear operations are not necessarily commutative, the desired advantage can be obtained and information-theoretic secrecy achieved even if the eavesdropper is given the cryptographic key immediately upon transmission completion. In essence, the lack of knowledge of the key during the short transmission time inhibits the recording of the signal in such a way that the secret information can never be extracted from it. The achievable secrecy rates for different countermeasures that the eavesdropper might employ are evaluated. It is shown that even in the case of an eavesdropper with uniformly better conditions (channel and receiver quality) than the intended recipient, a positive secrecy rate can be achieved.

arXiv:1210.1790IEEE Journal on Selected Areas in CommunicationsAug 23, 201324 citations

Artificial intersymbol interference (ISI) to exploit receiver imperfections for secrecy

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik

Secure communication over a wireless channel in the presence of a passive eavesdropper is considered. We present a method to exploit the eavesdropper's inherent receiver vulnerabilities to obtain everlasting secrecy. An ephemeral cryptographic key is pre-shared between the transmitter and the legitimate receiver and is utilized to induce intentional intersymbol interference (ISI). The legitimate receiver uses the key to cancel the ISI while the eavesdropper, since it does not have the key, cannot do such. It is shown that although ISI reduces the capacity of the main channel, it can lead to a net gain in secrecy rate. The achievable secrecy rates for different ISI filter settings are evaluated and the proposed method is compared with other information-theoretic security schemes.

IEEE International Symposium on Information Theory (ISIT)Jul 1, 201312 citations

Exploiting the non-commutativity of nonlinear operators for information-theoretic security in disadvantaged wireless environments

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik

Information-theoretic security guarantees that a message is kept secret from potential eavesdroppers regardless of their current or future computational abilities. But current information-theoretic security approaches generally rely on an advantage of the channel of the desired recipient over the adversary, and such an advantage can be difficult to guarantee in a wireless network where an eavesdropper might be very near the transmitter. This paper initiates an approach to everlasting security for wireless communication links by exploiting a fundamental concept from systems theory: that nonlinear systems are not (necessarily) commutative. This property is exploited by employing a short-term cryptographic key to force the eavesdropper's signal to be subjected to nonlinear operations in the reverse order of that of the signal at the desired recipient. After introducing the idea and providing analysis for the general case, we next consider a simple (and practical) instantiation where the transmitter uses the ephemeral cryptographic key to rapidly power modulate the transmitted signal. Secrecy rates with this rapid power modulation under various assumptions establish the promise of the approach, even in the case of an eavesdropper with uniformly better conditions (channel and receiver quality) than the intended recipient.

Allerton Conference on Communication, Control, and ComputingOct 1, 20126 citations

Achieving Secret Communication for

Li Zang, Roy D. Yates, Wade K. Trappe

We consider a secret communication scenario where Alice wants to transmit secretly to Bob in presence of a passive eavesdropper Eve. The Alice-Bob channel is a fixed-SNR AWGN channel, while the Alice-Eve channel is a fast Rayleigh fading channel, with the channel states only known to Eve. Alice knows the statistics of Alice-Eve channel, but not the exact realizations. We investigate the achievable secrecy rates for this channel model with Gaussian signaling and discrete signaling. For Gaussian signaling, several transmission strategies according to the main channel's relative channel gain are proposed and evaluated. For discrete signaling, achievable secrecy rates with Quadrature Am- plitude Modulation (QAM) are evaluated. When Bob's channel is much better than Eve's channel, simple Gaussian signaling can perform close to the upper bound, and is better than the rate achieved with M-QAM. When Bob's channel gain is on average worse than the eavesdropper's average channel gain, positive secrecy rate can still be achieved for Gaussian signaling with artificial noise injection and a burst signaling strategy. Moreover, M-QAM can outperform Gaussian signaling. The key factor that enables secret communication in this case is that both M-QAM and artificial noise limit the leakage of information when Eve's channel is unusually good.

Jan 1, 20100 citations

Communicating over wireless channels with information-theoretic secrecy

Xiaojun Tang

Wireless systems are susceptible to eavesdropping as an unwelcome result of the broadcast nature of the wireless medium. Fortunately, the wireless medium also provides endowments including the temporal dispersion, the capability of signal superposition and other properties, to facilitate defending against eavesdropping. The focus of the thesis is to provide schemes for utilizing these properties at the physical layer and their performance analysis from an information-theoretic secrecy perspective. The work is based on Wyner's results on the wire-tap channel, in which the transmission between two legitimate users (Alice and Bob) is eavesdropped upon by Eve. The secrecy level is measured by the equivocation rate at Eve. The system performance is measured by the secrecy capacity. This is the maximum rate at which a message can be sent from Alice to Bob, while constraining the equivocation rate at Eve equal to the communication rate, and thus ensuring that Eve cannot deduce any useful information asymptotically. First, the scenario where a secret message needs to be delivered to the intended receiver within a given delay constraint and without the knowledge of the channel state information (CSI) at the transmitter is considered. In particular, hybrid automatic retransmission request (HARQ) protocols are revisited for a block-fading wire-tap channel via a joint consideration of channel coding, secrecy coding, and retransmission protocols. Two secure HARQ protocols: a repetition time diversity (RTD) scheme with maximal-ratio combining, and an incremental redundancy (INR) scheme based on ratecompatible Wyner secrecy codes are analyzed via an outage-based formulation. The throughput of RTD and INR protocols under probabilistic outage requirements is derived. Asymptotic analysis and numerical computations are given to demonstrate both the benefits of HARQ protocols and the tradeoff between reliability and confidentiality in delay-constrained communications. Second, the effects of interference on information-theoretic secret communication is considered. More specifically, the wiretap channel with a helping interferer (WT-HI) is proposed and studied. Here, an interferer, which does not know the confidential message, helps in ensuring the secrecy of the message by sending independent signals. Achievable secrecy rates and upper bounds on the secrecy capacity are given for both discrete memoryless and Gaussian channels. Interference has conventionally been regarded as a harmful phenomenon that leads to decreasing the rate and the reliability performance of wireless systems. In this work, it is shown that interference can be exploited to assist wireless secrecy. Lastly, the problem of secret key generation over fading channels, in which there exists an additional authenticated, public and error-free feedback channel from Bob to Alice, is considered. A key generation scheme consisting of a communication phase and a key-generation phase is presented. The communication phase is based on layered broadcast coding, which adapts the decoded rate at Bob to the actual channel state without requiring CSI available at Alice. The key-generation phase is based on the messages decoded by Bob after the communication phase and the public feedback. The achievable secrecy key rate and the optimal power distribution over coded layers for maximizing the secrecy key rate are characterized. Theoretical and numerical results show that the broadcast approach outperforms the single-level-coding based approach significantly, and hence demonstrate the role of introducing self-interference in facilitating secret-key generation over slowly fading channels when transmit CSI is not available.

Jan 1, 20100 citations