Abstract | ||
---|---|---|
Authentication in the presence of a malicious adversary consists of either recovering the legitimate transmission or declaring that the adversary has interfered with the transmission. In this work, we present a structured coding scheme for keyless authentication over a discrete memoryless binary-input, symmetric adversarial channel. Our scheme allows for coding rates up to the non-adversarial capacity of the underlying channel, as well as bounded-complexity decoding. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1109/ISIT.2019.8849581 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Field | DocType | Citations |
Discrete mathematics,Authentication,Computer science,Computer network,Communication channel,Coding (social sciences),Decoding methods,Adversary,Adversarial system | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Allison Beemer | 1 | 1 | 4.41 |
Oliver Kosut | 2 | 12 | 2.66 |
Jörg Kliewer | 3 | 17 | 3.02 |
Eric Graves | 4 | 0 | 0.68 |
Paul L. Yu | 5 | 113 | 16.40 |