Realizing the vision of information-theoretic security

Error message

Deprecated function: The each() function is deprecated. This message will be suppressed on further calls in _menu_load_objects() (line 579 of /var/www/vhosts/

Sponsor: National Science Foundation under Award 1320298

A significant amount of sensitive data communicated over wireless media makes wireless communication security an issue of paramount importance. The standard implemented solution to security over wireless networks is based on a modular approach in which transmission and encryption are carried out separately. State-of-the-art encryption algorithms are thus agnostic to the characteristics of the underlying network, but this separation approach is increasingly hard to justify as fast and reliable communications over wireless networks require more effective security architectures. Several theoretical insights have been obtained from information theory in the past few years that suggest that fundamentally secure transmission in wireless interference networks is possible by jointly designing for reliability and security at the outset. This project takes a distinctive approach to accelerate the deployment of information-theoretically secure design of wireless networks by analyzing models with realistic assumptions, developing practical coding schemes and validating with a wireless test-bed. The project investigates two intertwined research tasks: (i) overcoming modeling assumptions, by providing security guarantees irrespective of adversaries' channels, modeling and countering adversaries that can manipulate channel conditions to their advantage, and removing idealized assumptions in implementation; (ii) providing explicit channel code designs that ensure strong secrecy and developing secure codes for multi-terminal wireless networks.

Scientific activities

Fundamental limits of physical-layer security

  • Strong converse for degraded wiretap channels [1][2]
  • Channel resolvability as the coding mechanism for secrecy [3][4][5]
  • Robustness w.r.t uniformity assumptions: [6][7]
  • Sequential key distillation: [8]

Code design for physical-layer security

  • LDPC codes for compound wiretap channels [9]
  • Polar codes for secret-key generation [10][11]
  • Polar codes for wiretap channels [12][13]

Experimental systems

  • Secret-key generation from wireless channel gains [14]

Outreach activities


  1. Information spectrum approach to strong converse theorems for degraded wiretap channels,
    Tan, Vincent Y. F., and Bloch Matthieu R.
    , Proc. of 52nd Annual Allerton Conference on Communication, Control, and Computing, September, Monticello, IL, p.747-754, (2014)
  2. Information Spectrum Approach to Strong Converse Theorems for Degraded Wiretap Channels,
    Tan, Vincent Y. F., and Bloch Matthieu R.
    , IEEE Transactions on Information Forensics and Security, September, Volume 10, Issue 9, p.1891-1904, (2015)
  3. Strong Secrecy from Channel Resolvability,
    Bloch, Matthieu R., and J. Laneman Nicholas
    , {IEEE} {T}ransactions on {I}nformation {T}heory, December, Volume 59, Number 12, p.8077-8098, (2013)
  4. Error-Control Coding for Physical-Layer Secrecy,
    Bloch, Matthieu R., Hayashi Masahito, and Thangaraj Andrew
    , Proceedings of IEEE, October, Volume 103, Issue 10, p.1725-1746, (2015)
  5. A Channel Resolvability Perpsective on Stealth Communications,
    Bloch, Matthieu R.
    , IEEE International Symposium on Information Theory, June, Hong Kong, p.2535 - 2539, (2015)
  6. Lossless and Lossy Source Compression with Near-Uniform Outputs: Is Common Randomness Always Required?,
    Vellambi, Badri N., Bloch Matthieu R., Chou Rémi A., and Kliewer Jörg
    , Proc. IEEE International Symposium on Information Theory, June, Honk Kong, p.2171-2175, (2015)
  7. Uniform Distributed Source Coding for the Multiple Access Wiretap Channel,
    Arumugam, Keerthi Suria Kuma, and Bloch Matthieu R.
    , Proc. of IEEE Conference on Communications and Network Security, October, San Francisco, CA, p.127–132, (2014)
  8. Separation of Reliability and Secrecy in Rate-Limited Secret Key-Distillation,
    Chou, Rémi A., and Bloch Matthieu R.
    , IEEE Transactions on Information Theory, August, Volume 60, Number 8, p.4941–4957, (2014)
  9. The Anti-Diversity Concept for Secure Communication on a Two-Link Compound Channel,
    Boutros, Joseph J., Dedeoglu Volkan, and Bloch Matthieu R.
    , Proc. of International Zurich Seminar on Communications, February, Zurich, Switzerland, (2014)
  10. Low-Complexity Channel Resolvability Codes for the Symmetric Multiple-Access Channel,
    Arumugam, Keerthi Suria Kuma, Bloch Matthieu R., and Kliewer Jörg
    , Proc. of IEEE Information Theory Workshop, November, Hobart, Tasmania, p.466–470, (2014)
  11. Polar Coding for Secret-Key Generation,
    Chou, Rémi A., Bloch Matthieu R., and Abbe Emmanuel
    , IEEE Transactions on Information Theory, November, Volume 61, Issue 11, (2015)
  12. Polar Coding for the Broadcast Channel with Confidential Messages,
    Chou, Rémi A., and Bloch Matthieu R.
    , Proc. IEEE Information Theory Workshop, May, Jerusalem, Israel, p.1-5, (2015)
  13. Polar Coding for the Broadcast Channel with Confidential Messages: A Random Binning Analogy,
    Chou, Rémi A., and Bloch Matthieu R.
    , IEEE Transactions on Information Theory, May, Volume 62, Issue 5, p.2410-2429, (2016)
  14. The Effect of Eavesdropper's Statistics in Experimental Wireless Secret-Key Generation,
    Pierrot, Alexandre J., Arumugam Keerthi Suria Kuma, and Bloch Matthieu R.
    , June, (2014)