The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Covert Communication in the Presence of an Uninformed Jammer
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengijpta, S. K. (1995) · Technometrics · doi:10.1080/00401706.1995.10484391 · Cited by 11,076
Stochastic orders and their applications
Shaked, M., & Shanthikumar, J. G. (1994) · Cited by 2,125
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
Bash, B. A., Goeckel, D., & Towsley, D. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130923 · Cited by 1,075
Self-citationSteganography in Digital Media: Principles, Algorithms, and Applications
Fridrich, J. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9781139192903 · Cited by 570
Covert Communication Over Noisy Channels: A Resolvability Perspective
Bloch, M. R. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2530089 · Cited by 433
Fundamental Limits of Communication With Low Probability of Detection
Wang, L., Wornell, G. W., & Zheng, L. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2548471 · Cited by 371
Reliable deniable communication: Hiding messages in noise
Che, P. H., Bakshi, M., & Jaggi, S. (2013) · 2013 IEEE International Symposium on Information Theory · doi:10.1109/isit.2013.6620765 · Cited by 300
Achieving Undetectable Communication
Lee, S., Baxley, R. J., Weitnauer, M. A., & Walkenhorst, B. (2015) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2015.2421477 · Cited by 278
Fundamental Limits of Communication With Low Probability of DetectionPreprint
Wang, L., Wornell, G. W., & Zheng, L. (2016) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 205
Covert Communication Gains From Adversary’s Ignorance of Transmission Time
Bash, B. A., Goeckel, D., & Towsley, D. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2614502 · Cited by 160
Self-citationCovert Communications When the Warden Does Not Know the Background Noise Power
Goeckel, D., Bash, B. A., Guha, S., et al. (2015) · IEEE Communications Letters · doi:10.1109/lcomm.2015.2507594 · Cited by 149
Self-citationQuantum-secure covert communication on bosonic channels
Bash, B. A., Gheorghe, A. H., Patel, M., Habif, J. L., Goeckel, D., Towsley, D., & Guha, S. (2015) · Nature Communications · doi:10.1038/ncomms9626 · Cited by 128
Self-citationSquare root law for communication with low probability of detection on AWGN channels
Bash, B. A., Goeckel, D., & Towsley, D. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6284228 · Cited by 116
Self-citationReliable deniable communication with channel uncertainty
Che, P. H., Bakshi, M., Chan, C., & Jaggi, S. (2014) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2014.6970786 · Cited by 91
Covert communication over classical-quantum channels
Sheikholeslami, A., Bash, B. A., Towsley, D., Goeckel, D., & Guha, S. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541662 · Cited by 52
Self-citationCovert communication with the help of an uninformed jammer achieves positive rate
Sobers, T. V., Bash, B. A., Goeckel, D., et al. (2015) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2015.7421206 · Cited by 36
Self-citation
Cited by
Covert Communications: A Comprehensive Survey
Chen, X., An, J., Xiong, Z., Xing, C., Zhao, N., Yu, F. R., & Nallanathan, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3263921 · Cited by 371
Low Probability of Detection Communication: Opportunities and Challenges
Yan, S., Zhou, X., Hu, J., & Hanly, S. V. (2019) · IEEE Wireless Communications · doi:10.1109/mwc.001.1900057 · Cited by 361
On Covert Communication With Noise Uncertainty
He, B., Yan, S., Zhou, X., & Lau, V. K. N. (2017) · IEEE Communications Letters · doi:10.1109/lcomm.2016.2647716 · Cited by 335
Achieving Covert Wireless Communications Using a Full-Duplex Receiver
Shahzad, K., Zhou, X., Yan, S., Hu, J., Shu, F., & Li, J. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2878014 · Cited by 291
Delay-Intolerant Covert Communications With Either Fixed or Random Transmit Power
Yan, S., He, B., Zhou, X., Cong, Y., & Swindlehurst, A. L. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2846257 · Cited by 261
Metadata
- Authors
- Sobers, T. V., Bash, B. A., Guha, S., Towsley, D., & Goeckel, D.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2017-09
- Volume
- 16
- Issue
- 9
- Pages
- 6193-6206
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2506174538
- Cited by
- 449
- References
- 17
- FWCI
- 11.75
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.