Reliable deniable communication with channel uncertainty
- 1 November 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 16629019,p. 30-34
Abstract
Alice wishes to potentially communicate with Bob over a compound Binary Symmetric Channel while Willie listens in over a compound Binary Symmetric Channel that is noisier than Bob's. The channel noise parameters for both Bob and Willie are drawn according to uniform distribution over a range, but none of the three parties know their exact values. Willie's goal is to infer whether or not Alice is communicating with Bob. We show that Alice can send her messages reliably to Bob while ensuring that even whether or not she is actively communicating is deniable to Willie. We find the best rate at which Alice can communicate both deniably and reliably using Shannon's random coding and prove a converse.Keywords
This publication has 6 references indexed in Scilit:
- Reliable, deniable and hidable communication2014
- Limits of Reliable Communication with Low Probability of Detection on AWGN ChannelsIEEE Journal on Selected Areas in Communications, 2013
- Reliable deniable communication: Hiding messages in noise2013
- Square root law for communication with low probability of detection on AWGN channels2012
- Accurate Approximations for Posterior Moments and Marginal DensitiesJournal of the American Statistical Association, 1986
- The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabetProbability Theory and Related Fields, 1970