Azadeh Sheikholeslami
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Azadeh Sheikholeslami has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Dennis Goeckel
Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA, USA
3 shared publications - Boulat A. Bash
Electrical and Computer Engineering Department University of Arizona Tucson AZ USA
2 shared publications - Hossein Pishro-Nik
Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA, USA
2 shared publications Majid Ghaderi
Department of Computer Science , University of Calgary
2 shared publicationsDennis Goeckel
University of Massachusetts at Amherst, Amherst, MA, USA
1 shared publicationDon Towsley
College of Information and Computer Sciences, University of Mass., Amherst
1 shared publication
Latest Publications
- 13 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (4) , 2741-2762
Fundamental Limits of Covert Communication Over Classical-Quantum Channels
We investigate covert communication over general memoryless classical-quantum channels with fixed finite-size input alphabets. We show that the square root law (SRL) governs covert communication in this setting when product a of n input states is used: $L_{\mathrm { SRL}}\sqrt {n}+o(\sqrt {n})$ covert bits (but no more) can be reliably transmitted in n uses of classical-quantum channel, where $L_{\mathrm { SRL}}\gt 0$ is a channel-dependent constant that we call covert capacity. We also show that ensuring covertness requires $J_{\mathrm { SRL}}\sqrt {n}+o(\sqrt {n})$ bits secret key shared by the communicating parties prior to transmission, where $J_{\mathrm { SRL}}\geq 0$ is a channel-dependent constant. We assume a quantum-powerful adversary that can perform an arbitrary joint (entangling) measurement on all n channel uses. We determine the single-letter expressions for $L_{\mathrm { SRL}}$ and $J_{\mathrm { SRL}}$ , and establish conditions when $J_{\mathrm { SRL}}=0$ (i.e., no pre-shared secret key is needed). Finally, we evaluate scenarios where covert communication is not governed by the SRL.
- 13 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (4) , 2741-2762
Fundamental Limits of Covert Communication Over Classical-Quantum Channels
We investigate covert communication over general memoryless classical-quantum channels with fixed finite-size input alphabets. We show that the square root law (SRL) governs covert communication in this setting when product a of n input states is used: $L_{\mathrm { SRL}}\sqrt {n}+o(\sqrt {n})$ covert bits (but no more) can be reliably transmitted in n uses of classical-quantum channel, where $L_{\mathrm { SRL}}\gt 0$ is a channel-dependent constant that we call covert capacity. We also show that ensuring covertness requires $J_{\mathrm { SRL}}\sqrt {n}+o(\sqrt {n})$ bits secret key shared by the communicating parties prior to transmission, where $J_{\mathrm { SRL}}\geq 0$ is a channel-dependent constant. We assume a quantum-powerful adversary that can perform an arbitrary joint (entangling) measurement on all n channel uses. We determine the single-letter expressions for $L_{\mathrm { SRL}}$ and $J_{\mathrm { SRL}}$ , and establish conditions when $J_{\mathrm { SRL}}=0$ (i.e., no pre-shared secret key is needed). Finally, we evaluate scenarios where covert communication is not governed by the SRL.
- 13 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 17 (6) , 3656-3669
Multi-Hop Routing in Covert Wireless Networks
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.
- 13 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 17 (6) , 3656-3669
Multi-Hop Routing in Covert Wireless Networks
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.
- Open Access
- 15 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 65 (6) , 2522-2533
Energy-Efficient Secrecy in Wireless Networks Based on Random Jamming
This paper considers secure energy-efficient routing in the presence of multiple passive eavesdroppers. Previous work in this area has considered secure routing assuming probabilistic or exact knowledge of the location and channel-state-information (CSI) of each eavesdropper. In wireless networks, however, the locations and CSIs of passive eavesdroppers are not known, making it challenging to guarantee secrecy for any routing algorithm. We develop an efficient (in terms of energy consumption and computational complexity) routing algorithm that does not rely on any information about the locations and CSIs of the eavesdroppers. Our algorithm guarantees secrecy even in disadvantaged wireless environments, where multiple eavesdroppers try to eavesdrop each message, are equipped with directional antennas, or can get arbitrarily close to the transmitter. The key is to employ additive random jamming to exploit inherent non-idealities of the eavesdropper's receiver, which makes the eavesdroppers incapable of recording the messages. We have simulated our proposed algorithm and compared it with the existing secrecy routing algorithms in both single-hop and multi-hop networks. Our results indicate that when the uncertainty in the locations of eavesdroppers is high and/or in disadvantaged wireless environments, our algorithm outperforms existing algorithms in terms of energy consumption and secrecy.
- 15 March 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 65 (6) , 2522-2533
Open AccessEnergy-Efficient Secrecy in Wireless Networks Based on Random Jamming
This paper considers secure energy-efficient routing in the presence of multiple passive eavesdroppers. Previous work in this area has considered secure routing assuming probabilistic or exact knowledge of the location and channel-state-information (CSI) of each eavesdropper. In wireless networks, however, the locations and CSIs of passive eavesdroppers are not known, making it challenging to guarantee secrecy for any routing algorithm. We develop an efficient (in terms of energy consumption and computational complexity) routing algorithm that does not rely on any information about the locations and CSIs of the eavesdroppers. Our algorithm guarantees secrecy even in disadvantaged wireless environments, where multiple eavesdroppers try to eavesdrop each message, are equipped with directional antennas, or can get arbitrarily close to the transmitter. The key is to employ additive random jamming to exploit inherent non-idealities of the eavesdropper's receiver, which makes the eavesdroppers incapable of recording the messages. We have simulated our proposed algorithm and compared it with the existing secrecy routing algorithms in both single-hop and multi-hop networks. Our results indicate that when the uncertainty in the locations of eavesdroppers is high and/or in disadvantaged wireless environments, our algorithm outperforms existing algorithms in terms of energy consumption and secrecy.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 175, 1994-1998
Everlasting secrecy in disadvantaged wireless environments against sophisticated eavesdroppers
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.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 175, 1994-1998
Everlasting secrecy in disadvantaged wireless environments against sophisticated eavesdroppers
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.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2950-2954
Artificial intersymbol interference (ISI) to exploit receiver imperfections for secrecy
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.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2950-2954
Artificial intersymbol interference (ISI) to exploit receiver imperfections for secrecy
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.