The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Reliable deniable communication: Hiding messages in noise
Open accessAbstract
Alice may wish to reliably send a message to Bob over a binary symmetric channel (BSC) while ensuring that her transmission is deniable from an eavesdropper Willie. That is, if Willie observes a “significantly noisier” transmission than Bob does, he should be unable to estimate even whether Alice is transmitting or not. Even when Alice's (potential) communication scheme is publicly known to Willie (with no common randomness between Alice and Bob), we prove that over n channel uses Alice can transmit a message of length O(√n) bits to Bob, deniably from Willie. We also prove information-theoretically order-optimality of our results.
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
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
Steganography in Digital Media: Principles, Algorithms, and Applications
Fridrich, J. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9781139192903 · Cited by 570
Square 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
A Capacity Result for Batch Steganography
Ker, A. D. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2006.891319 · Cited by 113
The square root law of steganographic capacity
Ker, A. D., Pevný, T., Kodovský, J., & Fridrich, J. (2008) · ACM workshop on Multimedia and security · doi:10.1145/1411328.1411349 · Cited by 108
Perfectly Secure Steganography: Capacity, Error Exponents, and Code ConstructionsPreprint
Wang, Y., & Moulin, P. (2007) · Cited by 92
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
Wang, Y., & Moulin, P. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921684 · Cited by 83
The square root law does not require a linear key
Ker, A. D. (2010) · ACM workshop on Multimedia and security · doi:10.1145/1854229.1854267 · Cited by 20
The square root law requires a linear key
Ker, A. D. (2009) · ACM workshop on Multimedia and security · doi:10.1145/1597817.1597832 · Cited by 17
Cited by
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
Mukherjee, A., Fakoorian, S. A. A., Huang, J., & Swindlehurst, A. L. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2014.012314.00178 · Cited by 1,483
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
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
Metadata
- Authors
- Che, P. H., Bakshi, M., & Jaggi, S.
- Venue
- 2013 IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Published
- 2013-07
- Pages
- 2945-2949
- OpenAlex
- W2084796966
- Cited by
- 300
- References
- 9
- FWCI
- 13.84
- Type
- conference paper
- 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.