Embedding Covert Information on a Given Broadcast Code
| Title | Embedding Covert Information on a Given Broadcast Code |
| Publication Type | Conference Paper |
| Year of Publication | 2019 |
| Authors | Kibloff, David, Perlaza, Samir M., Wang, Ligong |
| Conference Name | 2019 IEEE International Symposium on Information Theory (ISIT) |
| Date Published | jul |
| ISBN Number | 978-1-5386-9291-2 |
| Keywords | asymptotic fundamental limits, Broadcast Channel, broadcast channels, broadcast code, channel capacity, channel coding, covert communication, covert communications, covert message, Decoding, decoding error probability, degraded discrete memoryless broadcast channel, DM-BC, embedding covert information, error probability, error statistics, general DM-BCs, Human Behavior, human factors, Indexes, information theoretic security, information-theoretic security, Low Probability of Detection, Metrics, necessary conditions, original broadcast communication, policy-based governance, Probability distribution, pubcrawl, random codes, random coding argument, Random variables, Receivers, resilience, Resiliency, Scalability, stronger receiver, Transmitters, weaker receiver |
| Abstract | Given a code used to send a message to two receivers through a degraded discrete memoryless broadcast channel (DM-BC), the sender wishes to alter the codewords to achieve the following goals: (i) the original broadcast communication continues to take place, possibly at the expense of a tolerable increase of the decoding error probability; and (ii) an additional covert message can be transmitted to the stronger receiver such that the weaker receiver cannot detect the existence of this message. The main results are: (a) feasibility of covert communications is proven by using a random coding argument for general DM-BCs; and (b) necessary conditions for establishing covert communications are described and an impossibility (converse) result is presented for a particular class of DM-BCs. Together, these results characterize the asymptotic fundamental limits of covert communications for this particular class of DM-BCs within an arbitrarily small gap. |
| URL | https://ieeexplore.ieee.org/document/8849435 |
| DOI | 10.1109/ISIT.2019.8849435 |
| Citation Key | kibloff_embedding_2019 |
- random codes
- information theoretic security
- information-theoretic security
- Low Probability of Detection
- Metrics
- necessary conditions
- original broadcast communication
- policy-based governance
- Probability distribution
- pubcrawl
- Indexes
- random coding argument
- Random variables
- Receivers
- resilience
- Resiliency
- Scalability
- stronger receiver
- Transmitters
- weaker receiver
- decoding error probability
- Broadcast Channel
- broadcast channels
- broadcast code
- channel capacity
- channel coding
- covert communication
- covert communications
- covert message
- Decoding
- asymptotic fundamental limits
- degraded discrete memoryless broadcast channel
- DM-BC
- embedding covert information
- error probability
- error statistics
- general DM-BCs
- Human behavior
- Human Factors