Strong secrecy and stealth for broadcast channels with confidential messages

@article{Bjelakovic2015StrongSA,
  title={Strong secrecy and stealth for broadcast channels with confidential messages},
  author={Igor Bjelakovic and Jafar Mohammadi and Sławomir Stańczak},
  journal={2016 IEEE International Symposium on Information Theory (ISIT)},
  year={2015},
  pages={2809-2813}
}
This paper extends the weak secrecy results of Liu et al. for broadcast channels with two confidential messages to strong secrecy. Our results are based on an extension of the techniques developed by Hou and Kramer on bounding Kullback-Leibler divergence in the context of resolvability and effective secrecy. 
View on IEEE
arxiv.org

Figures from this paper

References

SHOWING 1-10 OF 19 REFERENCES

Effective secrecy: Reliability, confusion and stealth

  • J. HouG. Kramer
  • Computer Science
    2014 IEEE International Symposium on Information Theory
  • 2014
To measure stealth the authors use resolvability and relate this to binary hypothesis testing and results are developed for wire-tap channels and broadcast channels with confidential messages.

Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions

An encoding scheme in which transmitters dedicate some of their power to create artificial noise is proposed and shown to outperform both time-sharing and simple multiplexed transmission of the confidential messages.

Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages

Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks and the secrecy capacity region of the MGBC-CM is established.

Strong Secrecy From Channel Resolvability

It is shown that at least for symmetric wiretap channels, random capacity- based constructions fail to achieve the strong secrecy capacity, while channel-resolvability-based constructions achieve it.

Broadcast channels with confidential messages

Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.

Reliability and Secrecy Functions of the Wiretap Channel Under Cost Constraint

The notion of reliability and secrecy functions are newly introduced as a fundamental tool to analyze and/or design the performance of an efficient wiretap channel system, including binary symmetric wiretap channels, Poisson wiretaps channels, and Gaussian wiretAP channels.

A proof of Marton's coding theorem for the discrete memoryless broadcast channel

A simple proof using random partitions and typicality is given for Marton's coding theorem for broadcast channels.

The wire-tap channel

  • A. Wyner
  • Computer Science
    The Bell System Technical Journal
  • 1975
This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.

The Strong Secret Key Rate of Discrete Random Triples

It is demonstrated that the known results for the secret key rate also hold for the stronger definition, and novel results on privacy amplification by Bennett, Brassard, Crepeau and Maurer are demonstrated.

Informational divergence approximations to product distributions

  • J. HouG. Kramer
  • Computer Science
    2013 13th Canadian Workshop on Information Theory
  • 2013
The minimum rate needed to accurately approximate a product distribution based on an unnormalized informational divergence is shown to be a mutual information. This result subsumes results of Wyner…