Name
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 denial of-service attack takes place, even if there are no limitations on computational complexity and computing capacity of the hardware. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/icassp.2019.8683553 | 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP) |
Keywords | Field | DocType |
Communication system, adversarial attack, Turing computability, Entscheidungsproblem | Wireless communication systems,Mathematical optimization,Entscheidungsproblem,Denial-of-service attack,Computer security,Computer science,Communications system,Turing machine,Turing computability,Adversarial system,Computational complexity theory | Conference |
ISSN | Citations | PageRank |
1520-6149 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Holger Boche | 1 | 2348 | 265.41 |
| Rafael F. Schaefer | 2 | 165 | 35.85 |
| H. V. Poor | 3 | 25411 | 1951.66 |