TY - GEN
T1 - Arbitrarily varying wiretap channels with finite coordination resources
AU - Boche, Holger
AU - Schaefer, Rafael F.
PY - 2014
Y1 - 2014
N2 - The wiretap channel models secure communication in the presence of a non-legitimate eavesdropper who has to be kept ignorant. In this paper, the arbitrarily varying wiretap channel (AVWC) is studied, in which the channel to both legitimate receiver and eavesdropper may vary in an unknown and arbitrary manner from channel use to channel use. It has been shown that for AVCs coordination between the transmitter and legitimate receiver based on common randomness (CR) is indispensable for reliable communication. Approaches taken so far yield CR-assisted strategies where the needed amount of CR increases unbounded with the block length. In this paper, it is shown that if we allow for a small but non-vanishing average probability of error and information leakage (in terms of weak secrecy), the amount of CR is always finite and independent of the block length. The corresponding secrecy capacity equals the one with asymptotically vanishing performance requirements. Furthermore, it is shown that the average decoding error at the eavesdropper can be made arbitrarily close to 1 regardless of the applied decoding strategy.
AB - The wiretap channel models secure communication in the presence of a non-legitimate eavesdropper who has to be kept ignorant. In this paper, the arbitrarily varying wiretap channel (AVWC) is studied, in which the channel to both legitimate receiver and eavesdropper may vary in an unknown and arbitrary manner from channel use to channel use. It has been shown that for AVCs coordination between the transmitter and legitimate receiver based on common randomness (CR) is indispensable for reliable communication. Approaches taken so far yield CR-assisted strategies where the needed amount of CR increases unbounded with the block length. In this paper, it is shown that if we allow for a small but non-vanishing average probability of error and information leakage (in terms of weak secrecy), the amount of CR is always finite and independent of the block length. The corresponding secrecy capacity equals the one with asymptotically vanishing performance requirements. Furthermore, it is shown that the average decoding error at the eavesdropper can be made arbitrarily close to 1 regardless of the applied decoding strategy.
UR - http://www.scopus.com/inward/record.url?scp=84906766297&partnerID=8YFLogxK
U2 - 10.1109/ICCW.2014.6881289
DO - 10.1109/ICCW.2014.6881289
M3 - Conference contribution
AN - SCOPUS:84906766297
SN - 9781479946402
T3 - 2014 IEEE International Conference on Communications Workshops, ICC 2014
SP - 746
EP - 751
BT - 2014 IEEE International Conference on Communications Workshops, ICC 2014
PB - IEEE Computer Society
T2 - 2014 IEEE International Conference on Communications Workshops, ICC 2014
Y2 - 10 June 2014 through 14 June 2014
ER -