Turing Meets Shannon: On the Algorithmic Computability of the Capacities of Secure Communication Systems (Invited Paper)
| Title | Turing Meets Shannon: On the Algorithmic Computability of the Capacities of Secure Communication Systems (Invited Paper) |
| Publication Type | Conference Paper |
| Year of Publication | 2019 |
| Authors | Schaefer, Rafael F., Boche, Holger, Poor, H. Vincent |
| Conference Name | 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) |
| Date Published | jul |
| ISBN Number | 978-1-5386-6528-2 |
| Keywords | active jammer, algorithmic computability, capacity expressions, communication scenarios, composability, compositionality, jamming, private key cryptography, pubcrawl, secret key generation, secure communication systems, theoretical cryptography, wiretap channel |
| 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. |
| URL | https://ieeexplore.ieee.org/document/8815442 |
| DOI | 10.1109/SPAWC.2019.8815442 |
| Citation Key | schaefer_turing_2019 |