Boulat A. Bash

Boulat A. Bash

Auto-generated profile, based on publicly available information

Boulat A. Bash

Electrical and Computer Engineering Department University of Arizona Tucson AZ USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 June 2017 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
TSTamara V. Sobers
Tamara V. Sobers
BBBoulat A. Bash
Boulat A. Bash
SGSaikat Guha
Saikat Guha
DTDon Towsley
Don Towsley
DGDennis Goeckel
Dennis Goeckel
Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to O(√n) bits in n channel uses. However, this assumes that Willie has an accurate statistical characterization of the channel. When Willie has uncertainty about such and his receiver is limited to a threshold test on the received power, Alice can transmit covertly with a power that does not decrease with n, thus conveying O(n) bits covertly and reliably in n uses of an AWGN channel. Here, we consider covert communication of O(n) bits in n channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume that an uninformed “jammer” is present to help Alice, and we consider AWGN and block fading channels. In some scenarios, Willie's optimal detector is a threshold test on the received power. When the channel between the jammer and Willie has multiple fading blocks per codeword, a threshold test on the received power is not optimal. However, we establish that Alice can remain covert with a transmit power that does not decrease with n even when Willie employs an optimal detector.

24 August 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
RSRamin Soltani
Ramin Soltani
DGDennis Goeckel
Dennis Goeckel
DTDon Towsley
Don Towsley
BBBoulat A. Bash
Boulat A. Bash
SGSaikat Guha
Saikat Guha
Covert communication conceals the transmission of the message from an attentive adversary. Recent work on the limits of covert communication in additive white Gaussian noise (AWGN) channels has demonstrated that a covert transmitter (Alice) can reliably transmit a maximum of O (√n) bits to a covert receiver (Bob) without being detected by an adversary (Warden Willie) in n channel uses. This paper focuses on the scenario where other “friendly” nodes distributed according to a two-dimensional Poisson point process with density m are present. We propose a strategy where the friendly node closest to the adversary, without close coordination with Alice, produces artificial noise. We show that this method allows Alice to reliably and covertly send O(min{n,mγ/2 √n}) bits to Bob in n channel uses, where is the path-loss exponent. We also consider a setting where there are Nw collaborating adversaries uniformly and randomly located in the environment and show that in n channel uses, Alice can reliably and covertly send O(min{n,mγ/2 √n/Nγw}) bits to Bob when γ > 2, and O(min{n, m√n/N2w log2 Nw}) when γ = 2. Conversely, we demonstrate that no higher covert throughput is possible for γ > 2.

29 September 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
BBBoulat A. Bash
Boulat A. Bash
DGDennis Goeckel
Dennis Goeckel
DTDon Towsley
Don Towsley
The recent square root law (SRL) for covert communication demonstrates that Alice can reliably transmit O(√n) bits to Bob in n uses of an additive white Gaussian noise (AWGN) channel while keeping ineffective any detector employed by the adversary; conversely, exceeding this limit either results in detection by the adversary with high probability or nonzero decoding error probability at Bob. This SRL is under the assumption that the adversary knows when Alice transmits (if she transmits); however, in many operational scenarios, he does not know this. Hence, here, we study the impact of the adversary's ignorance of the time of the communication attempt. We employ a slotted AWGN channel model with T(n) slots each containing n symbol periods, where Alice may use a single slot out of T(n). Provided that Alice's slot selection is secret, the adversary needs to monitor all T(n) slots for possible transmission. We show that this allows Alice to reliably transmit O(min{(n log T(n)) 1/2 , n}) bits to Bob (but no more) while keeping the adversary's detector ineffective. To achieve this gain over SRL, Bob does not have to know the time of transmission provided T(n) <; 2 cTn , c T = O(1).

13 March 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ASAzadeh Sheikholeslami
Azadeh Sheikholeslami
MGMajid Ghaderi
Majid Ghaderi
DTDon Towsley
Don Towsley
BBBoulat A. Bash
Boulat A. Bash
SGSaikat Guha
Saikat Guha
DGDennis Goeckel
Dennis Goeckel
In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared to the distance between Alice and Willie(s), the performance of covert communication will be degraded. In this case, multi-hop message transmission via intermediate relays can help to improve performance. Hence, in this work multi-hop covert communication over a moderate size network and in the presence of multiple collaboratingWillies is considered. The relays can transmit covertly using either a single key for all relays, or different independent keys at the relays. For each case, we develop efficient algorithms to find optimal paths with maximum throughput and minimum end-to-end delay between Alice and Bob. As expected, employing multiple hops significantly improves the ability to communicate covertly versus the case of a single-hop transmission. Furthermore, at the expense of more shared key bits, analytical results and numerical simulations demonstrate that multi-hop covert communication with different independent keys at the relays has better performance than multi-hop covert communication with a single key.

30 January 2020 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
MBMichael S. Bullock
Michael S. Bullock
CGChristos N. Gagatsos
Christos N. Gagatsos
SGSaikat Guha
Saikat Guha
BBBoulat A. Bash
Boulat A. Bash
We investigate the fundamental limit of quantum-secure covert communication over the lossy thermal noise bosonic channel, the quantum-mechanical model underlying many practical channels. We assume that the adversary has unlimited quantum information processing capabilities as well as access to all transmitted photons that do not reach the legitimate receiver. Given existence of noise that is uncontrolled by the adversary, the square root law (SRL) governs covert communication: up to c√n covert bits can be transmitted reliably in n channel uses. Attempting to surpass this limit results in detection with unity probability as n→∞. Here we present the expression for c, characterizing the SRL for the bosonic channel. We also prove that discrete-valued coherent state quadrature phase shift keying (QPSK) constellation achieves the optimal c, which is the same as that achieved by a circularly-symmetric complex-valued Gaussian prior on coherent state amplitude. Finally, while binary phase shift keying (BPSK) achieves the Holevo capacity for non-covert bosonic channels in the low received signal-to-noise ratio regime, we show that it is strictly sub-optimal for covert communication.

27 August 2020 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
CGChristos N. Gagatsos
Christos N. Gagatsos
MBMichael S. Bullock
Michael S. Bullock
BBBoulat A. Bash
Boulat A. Bash
We investigate the quantum-secure covert-communication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels: L no-EA , when Alice and Bob share only a classical secret, and L EA , when they benefit from entanglement assistance. We find that entanglement assistance alters the fundamental scaling law for covert communication. Instead of L no-EA √n - r no-EA (n), r no-EA (n) = o(√n), entanglement assistance allows L EA √nlogn - rEA(n), r EA (n) = o(√nlogn), covert bits to be transmitted reliably over n channel uses.