Turing Meets Shannon: On the Algorithmic Computability of the Capacities of Secure Communication Systems (Invited Paper)

Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Invited › peer-review

Contributors

  • Rafael F. Schaefer - , Technical University of Berlin (Author)
  • Holger Boche - , Technical University of Munich (Author)
  • H. Vincent Poor - , Princeton University (Author)

Abstract

This paper presents the recent progress in studying the algorithmic computability of capacity expressions of secure communication systems. Several communication scenarios are discussed and reviewed including the classical wiretap channel, the wiretap channel with an active jammer, and the problem of secret key generation.

Details

Original languageEnglish
Title of host publication2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
Pages1-5
ISBN (electronic)978-1-5386-6528-2
Publication statusPublished - Jul 2019
Peer-reviewedYes
Externally publishedYes

Publication series

SeriesIEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
ISSN1948-3244

Conference

Title20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2019
Duration2 - 5 July 2019
CityCannes
CountryFrance

External IDs

ORCID /0000-0002-1702-9075/work/165878255

Keywords

ASJC Scopus subject areas