TY - GEN
T1 - Jamming strategies in covert communication
AU - Shmuel, Ori
AU - Cohen, Asaf
AU - Gurewitz, Omer
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - Consider the communication problem where Alice tries to send a message towards Bob while trying to conceal the presence of communication from a watchful adversary, Willie, which tries to determine if a transmission took place or not. Under the basic settings, where all variables are known to Willie, the total amount of information bits that can be transmitted covertly and reliably in n independent channel uses is (formula presented) (a.k.a the square-root law). Thus, the resulting rate is (formula presented) which goes to zero as (formula presented). However, when a jammer is present and assists Alice by creating uncertainty in Willie’s decoder, this transmission may have a strictly positive rate. In this work, we consider the case where the jammer is equipped with multiple antennas. We analyze this case and present transmission strategies for the jammer in order to maximize his assistance to Alice, in terms of maximizing a ratio between Willie’s and Bob’s noise variances. Specifically, the analysis is performed for the cases were Bob is equipped with multiple antennas and employs a linear receiver. Our results indicate that the jammer’s transmission strategy is to perform beamforming towards a single direction which depends on the channel coefficients of both the legitimate receiver and the adversary. However, in case Bob is able to cancel the jammer’s interference completely, then the jammer’s strategy becomes independent and may be set according to the channel coefficients of the adversary alone.
AB - Consider the communication problem where Alice tries to send a message towards Bob while trying to conceal the presence of communication from a watchful adversary, Willie, which tries to determine if a transmission took place or not. Under the basic settings, where all variables are known to Willie, the total amount of information bits that can be transmitted covertly and reliably in n independent channel uses is (formula presented) (a.k.a the square-root law). Thus, the resulting rate is (formula presented) which goes to zero as (formula presented). However, when a jammer is present and assists Alice by creating uncertainty in Willie’s decoder, this transmission may have a strictly positive rate. In this work, we consider the case where the jammer is equipped with multiple antennas. We analyze this case and present transmission strategies for the jammer in order to maximize his assistance to Alice, in terms of maximizing a ratio between Willie’s and Bob’s noise variances. Specifically, the analysis is performed for the cases were Bob is equipped with multiple antennas and employs a linear receiver. Our results indicate that the jammer’s transmission strategy is to perform beamforming towards a single direction which depends on the channel coefficients of both the legitimate receiver and the adversary. However, in case Bob is able to cancel the jammer’s interference completely, then the jammer’s strategy becomes independent and may be set according to the channel coefficients of the adversary alone.
KW - Covert communication
KW - Jamming
KW - MIMO
UR - http://www.scopus.com/inward/record.url?scp=85068227910&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-20951-3_1
DO - 10.1007/978-3-030-20951-3_1
M3 - Conference contribution
AN - SCOPUS:85068227910
SN - 9783030209506
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 15
BT - Cyber Security Cryptography and Machine Learning - 3rd International Symposium, CSCML 2019, Proceedings
A2 - Dolev, Shlomi
A2 - Hendler, Danny
A2 - Lodha, Sachin
A2 - Yung, Moti
PB - Springer Verlag
T2 - 3rd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2019
Y2 - 27 June 2019 through 28 June 2019
ER -