Hiding information in noise: fundamental limits of covert wireless communication

@article{Bash2015HidingII,
  title={Hiding information in noise: fundamental limits of covert wireless communication},
  author={Boulat A. Bash and Dennis L. Goeckel and Donald F. Towsley and Saikat Guha},
  journal={IEEE Communications Magazine},
  year={2015},
  volume={53},
  pages={26-31}
}
Widely deployed encryption-based security prevents unauthorized decoding, but does not ensure undetectability of communication. However, covert, or low probability of detection/intercept communication is crucial in many scenarios ranging from covert military operations and the organization of social unrest, to privacy protection for users of wireless networks. In addition, encrypted data or even just the transmission of a signal can arouse suspicion, and even the most theoretically robust… Expand
Hiding Data in Plain Sight: Undetectable Wireless Communications Through Pseudo-Noise Asymmetric Shift Keying
TLDR
A wireless system based on a pseudo-noise asymmetric shift keying (PN-ASK) modulation, where covert symbols are mapped by shifting the amplitude of primary symbols to be undetectable and improves the throughput by more than 8x with respect to prior art. Expand
A reliable covert channel over IEEE 802.15.4 using steganography
TLDR
This paper proposes a reliable method for covert data communication using redundancy in the direct spread spectrum sequences and proposes a secret acknowledgment and error detection method to ensure reliable communication in the covert channel. Expand
Covert Wireless Communications in IoT Systems: Hiding Information in Interference
TLDR
It is found that the uncertainty of the aggregated interference experienced by the adversary is beneficial to the potential transmitters, and the square root law becomes invalid, and jammer-assisted schemes have little effect on the covertness in the presence of active eavesdropper. Expand
A Physical-Layer Security Based on Wireless Steganography Through OFDM and DFT-Precoded OFDM Signals
TLDR
A physical-layer security approach based on the concept of steganography for IoT networks reveals that judicious selection of cover signal power may increase the detection error probability of Willie and thus improve the covertness. Expand
Covert/Stealth/Low Probability of Detection Communications and QKD
  • I. Djordjevic
  • Computer Science
  • Physical-Layer Security and Quantum Key Distribution
  • 2019
This chapter is devoted to covert communications, also known as low probability of detection/intercept, as well as stealth communications, and how they can improve secret-key rate for QKDExpand
A Wireless Covert Channel Based on Dirty Constellation with Phase Drift
TLDR
A novel method of steganographic transmission which is based on phase drift in phase-shift keying or quadrature amplitude modulation (QAM) and is included in the so-called dirty constellation techniques. Expand
An Adaptive Audio Steganography for Covert Wireless Communication
TLDR
Experimental results demonstrate that the proposed adaptive audio steganography method has better performance in embedding rate and invisibility than other audio Steganography methods. Expand
Covert Wireless Communications with Active Eavesdropper on AWGN Channels
TLDR
This work systematically evaluated the security properties of covert communications in a dense wireless network, and proposed a density-based routing scheme to deal with multi-hop covert communication in a wireless network. Expand
LPD communication when the warden does not know when
TLDR
It is proved that if Alice has AWGN channels to Bob and the warden, and if she and Bob can choose a single n symbol period slot out of T(n) such slots, keeping the selection secret from the w Warden, then Alice can reliably transmit O(min{√n log T( n),n}) bits to Bob while keeping the wARD's detector ineffective. Expand
On Covert Communication with Interference Uncertainty
TLDR
Interference can indeed improve the performance of covert communication in large-scale wireless networks, where the transmitters form a stationary Poisson point process, and Alice wishes to communicate covertly to Bob without being detected by warden Dave. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
Secure space-time communication
  • A. Hero
  • Computer Science
  • IEEE Trans. Inf. Theory
  • 2003
TLDR
The principal conclusions of this paper are that proper exploitation of space-time diversity at the transmitter can also enhance information security and information-hiding capabilities and it is shown that significant gains are achievable when the transmitter and the client receiver are both informed about their channel while the transmitters and eavesdropper receiver are uniformed about theirChannel. Expand
Covert single-hop communication in a wireless network with distributed artificial noise generation
TLDR
This paper establishes achievability results by considering constructions where the system node closest to the warden produces artificial noise and demonstrates a significant improvement in the throughput achieved covertly, without requiring close coordination between Alice and the noise-generating node. Expand
Secret Agent Radio: Covert Communication through Dirty Constellations
TLDR
The technique is called Dirty Constellation because it hides the covert messages within a "dirty" constellation that mimics noise commonly imposed by hardware imperfections and channel conditions. Expand
LPD communication when the warden does not know when
TLDR
It is proved that if Alice has AWGN channels to Bob and the warden, and if she and Bob can choose a single n symbol period slot out of T(n) such slots, keeping the selection secret from the w Warden, then Alice can reliably transmit O(min{√n log T( n),n}) bits to Bob while keeping the wARD's detector ineffective. Expand
Covert Communication Over Noisy Channels: A Resolvability Perspective
  • M. Bloch
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2016
TLDR
A coding scheme based on the principle of channel resolvability is developed, which proves that if the receiver's channel is better than the warden's channel, it is possible to communicate on the order of √n reliable and covert bits over n channel uses without a secret key. Expand
Covert Communication Gains From Adversary’s Ignorance of Transmission Time
TLDR
It is shown that a slotted AWGN channel model with T(n) slots each containing n symbol periods 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. Expand
Secret communication in large wireless networks without eavesdropper location information
We present achievable scaling results on the per-node secure throughput that can be realized in a large random wireless network of n legitimate nodes in the presence of m eavesdroppers of unknownExpand
Reliable deniable communication: Hiding messages in noise
TLDR
It is proved that over n channel uses Alice can transmit a message of length O(√n) bits to Bob, deniably from Willie, and information-theoretically order-optimality of the results are proved. Expand
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
We present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels. Specifically, if theExpand
The Relay–Eavesdropper Channel: Cooperation for Secrecy
TLDR
The utility of user cooperation in facilitating secure wireless communications is established and an outer-bound on the optimal rate-equivocation region is derived and the novel noise-forwarding strategy is used to illustrate the deaf helper phenomenon. Expand
...
1
2
...