Detectability of Denial-of-service Attacks on Communication Systems

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Contributors

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

Abstract

Wireless communication systems are inherently vulnerable to adversarial attacks since malevolent jammers might jam and disrupt the legitimate transmission intentionally. Accordingly it is of crucial interest for the legitimate users to detect such adversarial attacks. This paper develops a detection framework based on Turing machines and studies the detectability of adversarial attacks. Of particular interest are so-called denial-of-service attacks in which the jammer is able to completely prevent any transmission. It is shown that there exists no Turing machine which can detect such an attack and consequently there is no algorithm that can decide whether or not such a denialof-service attack takes place, even if there are no limitations on computational complexity and computing capacity of the hardware.

Details

Original languageEnglish
Title of host publication2019 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2532-2536
Number of pages5
ISBN (electronic)978-1-4799-8131-1
Publication statusPublished - May 2019
Peer-reviewedYes
Externally publishedYes

Publication series

SeriesInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP)
Volume2019-May
ISSN1520-6149

Conference

Title44th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2019
Duration12 - 17 May 2019
CityBrighton
CountryUnited Kingdom

External IDs

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

Keywords

Keywords

  • adversarial attack, Communication system, Entscheidungsproblem, Turing computability