TY - GEN
T1 - Authentication capacity of adversarial channels
AU - Kosut, Oliver
AU - Kliewer, Jörg
N1 - Publisher Copyright:
© 2018 IEEE Information Theory Workshop, ITW 2018. All rights reserved.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - Keyless authentication is considered in an adversarial point-to-point channel. Namely, a legitimate transmitter and receiver aim to communicate over a noisy channel that may or may not also contain an active adversary, capable of transmitting an arbitrary signal into the channel. If the adversary is not present, then the receiver must successfully decode the message with high probability; if it is present, then the receiver must either decode the message or detect the adversary's presence. Thus, whenever the receiver decodes, it can be certain that the decoded message is authentic. The exact authentication capacity is characterized for discrete-memoryless adversary channels, where the adversary is assumed to know the code but not the message. The authentication capacity is shown to be either zero or equal to the no-adversary capacity, depending on whether the channel satisfies a condition termed overwritability.
AB - Keyless authentication is considered in an adversarial point-to-point channel. Namely, a legitimate transmitter and receiver aim to communicate over a noisy channel that may or may not also contain an active adversary, capable of transmitting an arbitrary signal into the channel. If the adversary is not present, then the receiver must successfully decode the message with high probability; if it is present, then the receiver must either decode the message or detect the adversary's presence. Thus, whenever the receiver decodes, it can be certain that the decoded message is authentic. The exact authentication capacity is characterized for discrete-memoryless adversary channels, where the adversary is assumed to know the code but not the message. The authentication capacity is shown to be either zero or equal to the no-adversary capacity, depending on whether the channel satisfies a condition termed overwritability.
UR - http://www.scopus.com/inward/record.url?scp=85062095844&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85062095844&partnerID=8YFLogxK
U2 - 10.1109/ITW.2018.8613353
DO - 10.1109/ITW.2018.8613353
M3 - Conference contribution
AN - SCOPUS:85062095844
T3 - 2018 IEEE Information Theory Workshop, ITW 2018
BT - 2018 IEEE Information Theory Workshop, ITW 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Information Theory Workshop, ITW 2018
Y2 - 25 November 2018 through 29 November 2018
ER -