The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Covert Communication Over Noisy Channels: A Resolvability Perspective
Open accessAbstract
We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel, while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals through another discrete memoryless channel. We develop a coding scheme based on the principle of channel resolvability, which generalizes and extends prior work in several directions. First, it shows that irrespective of the quality of the channels, it is possible to communicate on the order of √n reliable and covert bits over n channel uses if the transmitter and the receiver share on the order of √n key bits. This improves upon earlier results requiring on the order of √n log n key bits. Second, it proves that if the receiver's channel is better than the warden's channel in a sense that we make precise, it is possible to communicate on the order of √n reliable and covert bits over n channel uses without a secret key. This generalizes earlier results established for binary symmetric channels. We also identify the fundamental limits of covert and secret communications in terms of the optimal asymptotic scaling of the message size and key size, and we extend the analysis to Gaussian channels. The main technical problem that we address is how to develop concentration inequalities for low-weight sequences. The crux of our approach is to define suitably modified typical sets that are amenable to concentration inequalities.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Divergence measures based on the Shannon entropy
Lin, J. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.61115 · Cited by 5,140
Testing Statistical Hypotheses
(2021) · Wiley Series in Probability and Statistics · doi:10.1002/9781119243830.ch12 · Cited by 5,106
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Concentration Inequalities: A Nonasymptotic Theory of Independence
Boucheron, S., Lugosi, G., & Massart, P. (2013) · doi:10.1093/acprof:oso/9780199535255.001.0001 · Cited by 1,768
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
Testing Statistical Hypotheses
Neath, A. A. (2006) · Journal of the American Statistical Association · doi:10.1198/jasa.2006.s100 · Cited by 948
A general formula for channel capacity
Verdu, S., & Han, T. S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335960 · Cited by 779
Information-Spectrum Methods in Information Theory
Han, T. S. (2003) · Stochastic Modelling and Applied Probability · doi:10.1007/978-3-662-12066-8 · Cited by 682
Hiding information in noise: fundamental limits of covert wireless communication
Bash, B. A., Goeckel, D., Towsley, D., & Guha, S. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7355562 · Cited by 388
An information-theoretic model for steganography
Cachin, C. (2004) · Information and Computation · doi:10.1016/j.ic.2004.02.003 · Cited by 341
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
Secure space-time communication
Hero, A. O. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820010 · Cited by 294
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
Cuff, P. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2279330 · Cited by 239
Strong Secrecy From Channel Resolvability
Bloch, M. R., & Laneman, J. N. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2283722 · Cited by 214
Self-citationFundamental 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 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
Effective secrecy: Reliability, confusion and stealth
Hou, J., & Kramer, G. G. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874903 · Cited by 139
Quantum-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
A Capacity Result for Batch Steganography
Ker, A. D. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2006.891319 · Cited by 113
Noisy Channel Coding via Privacy Amplification and Information Reconciliation
Renes, J. M., & Renner, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162226 · Cited by 110
Reliable 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
LPD communication when the warden does not know when
Bash, B. A., Goeckel, D., & Towsley, D. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874904 · Cited by 86
Reliability and Secrecy Functions of the Wiretap Channel Under Cost Constraint
Han, T. S., Endo, H., & Sasaki, M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2355811 · Cited by 61
Limits of low-probability-of-detection communication over a discrete memoryless channel
Wang, L., Wornell, G. W., & Zheng, L. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282911 · Cited by 26
Reliable, deniable and hidable communication
Che, P. H., Bakshi, M., Chan, C., & Jaggi, S. (2014) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2014.6804271 · Cited by 26
Quantum noise limited optical communication with low probability of detection
Bash, B. A., Guha, S., Goeckel, D., & Towsley, D. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620520 · Cited by 21
Reliable, deniable and hidable communication: A quick survey
Che, P. H., Kadhe, S., Bakshi, M., et al. (2014) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2014.6970826 · Cited by 20
A channel resolvability perspective on stealth communications
Bloch, M. R. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282913 · Cited by 10
Self-citation
Cited by
Semantic Communications for Future Internet: Fundamentals, Applications, and Challenges
Yang, W., Du, H., Liew, Z. Q., Lim, W. Y. B., Xiong, Z., Niyato, D., Chi, X., Shen, X., & Miao, C. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3223224 · Cited by 670
Covert Communication in the Presence of an Uninformed Jammer
Sobers, T. V., Bash, B. A., Guha, S., Towsley, D., & Goeckel, D. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2720736 · Cited by 449
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
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
Metadata
- Authors
- Bloch, M. R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-05
- Volume
- 62
- Issue
- 5
- Pages
- 2334-2354
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1897081267
- Cited by
- 433
- References
- 29
- FWCI
- 20.73
- Type
- journal article
- Language
- en
- Open access
- green
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.