Delay-Intolerant Covert Communications With Either Fixed or Random Transmit Power
Open accessThe DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Abstract
In this paper, we study delay-intolerant covert communications in additive white Gaussian noise (AWGN) channels with a finite block length, i.e., a finite number of channel uses. Considering the maximum allowable number of channel uses to be N, it is not immediately clear whether the actual number of channel uses, denoted by n, should be as large as N or smaller for covert communications. This is because a smaller n reduces a warden's chance to detect the communications due to fewer observations, but also reduces the chance to transmit information. We show that n = N is indeed optimal to maximize the amount of information bits that can be transmitted, subject to any covert communication constraint in terms of the warden's detection error probability. To better make use of the warden's uncertainty due to the finite block length, we also propose to use uniformly distributed random transmit power to enhance covert communications. Our examination shows that the amount of information that can be covertly transmitted logarithmically increases with the number of random power levels, which indicates that most of the benefit of using random transmit power is achieved with just a few different power levels.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Table of Integrals, Series, and Products
(2000) · Elsevier eBooks · doi:10.1016/b978-0-12-294757-5.x5000-4 · Cited by 8,408
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
Spread spectrum communications handbook
(1995) · Choice Reviews Online · doi:10.5860/choice.32-3356 · Cited by 1,209
Physical-Layer Security: From Information Theory to Security Engineering
Bloch, M., & Barros, J. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511977985 · Cited by 1,156
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
Physical-Layer Security: From Information Theory to Security Engineering
Bloch, M. R., & Barros, J. (2011) · CERN Document Server (European Organization for Nuclear Research) · Cited by 695
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
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
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
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
Aaoc, C. (2013) · Cited by 343
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
Self-citationReliable 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
Physical Layer Security in Wireless Communications
(2016) · CRC Press eBooks · doi:10.1201/b15496 · Cited by 255
Covert Communication Achieved by a Greedy Relay in Wireless Networks
Hu, J., Yan, S., Zhou, X., Shu, F., Li, J., & Wang, J. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2831217 · Cited by 220
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 Communication in Fading Channels under Channel Uncertainty
Shahzad, K., Zhou, X., & Yan, S. (2017) · 2017 IEEE 85th Vehicular Technology Conference (VTC Spring) · doi:10.1109/vtcspring.2017.8108525 · Cited by 194
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
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
Keyless covert communication over Multiple-Access Channels
Arumugam, K. S. K., & Bloch, M. R. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541695 · Cited by 86
Covert Communications with a Full-Duplex Receiver over Wireless Fading Channels
Hu, J., Shahzad, K., Yan, S., Zhou, X., Shu, F., & Li, J. (2018) · International Conference on Communications · doi:10.1109/icc.2018.8422941 · Cited by 80
Self-citationThroughput of Cognitive Radio Systems with Finite Blocklength Codes
Özcan, G., & Gursoy, M. C. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.131133 · Cited by 78
Covert communication with finite blocklength in AWGN channels
Yan, S., He, B., Cong, Y., et al. (2017) · International Conference on Communications · doi:10.1109/icc.2017.7996337 · Cited by 60
Self-citationCovert Communication in Wireless Relay Networks
Hu, J., Yan, S., Zhou, X., et al. (2017) · Globecom · doi:10.1109/glocom.2017.8254008 · Cited by 43
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
Chen, D., Geng, Z., & Ma, Z.-M. (2011) · Frontiers of Mathematics · doi:10.1007/s11464-011-0159-0 · Cited by 34
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
Second-order asymptotics of covert communications over noisy channels
Tahmasbi, M., & Bloch, M. R. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541694 · Cited by 18
Computationally efficient deniable communication
Zhang, Q., Bakshi, M., & Jaggi, S. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541696 · Cited by 16
Optimal power allocation for parallel Gaussian channels with LPD constraints
Letzepis, N. (2016) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom.2016.7795309 · Cited by 7
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
Self-citationAchieving 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
Self-citationLv, L., Wu, Q., Li, Z., Ding, Z., Al-Dhahir, N., & Chen, J. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3106346 · Cited by 257
Metadata
- Authors
- Yan, S., He, B., Zhou, X., Cong, Y., & Swindlehurst, A. L.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2019-01
- Volume
- 14
- Issue
- 1
- Pages
- 129-140
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2808367635
- Cited by
- 261
- References
- 34
- FWCI
- 8.47
- 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.