TY - GEN
T1 - Robust and secure identification
AU - Boche, Holger
AU - Deppe, Christian
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/8/9
Y1 - 2017/8/9
N2 - We determine the identification capacity of compound channels with and without wiretapper. It turned out, that the secure capacity formula fulfill a dichotomy theorem. It is positive if its secure capacity is positive and equals the transmission capacity of the channel. Otherwise the capacity is zero. We analyze the (dis-)continuity and (super-)additivity of the capacities, which we determined. Alon gave in [6] a conjecture about maximal violation for the additivity for capacity functions. We show that this maximal violation holds for the secure identification capacity. This is the first example of a capacity function, which has this behavior.
AB - We determine the identification capacity of compound channels with and without wiretapper. It turned out, that the secure capacity formula fulfill a dichotomy theorem. It is positive if its secure capacity is positive and equals the transmission capacity of the channel. Otherwise the capacity is zero. We analyze the (dis-)continuity and (super-)additivity of the capacities, which we determined. Alon gave in [6] a conjecture about maximal violation for the additivity for capacity functions. We show that this maximal violation holds for the secure identification capacity. This is the first example of a capacity function, which has this behavior.
UR - http://www.scopus.com/inward/record.url?scp=85034060998&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2017.8006787
DO - 10.1109/ISIT.2017.8006787
M3 - Conference contribution
AN - SCOPUS:85034060998
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1539
EP - 1543
BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017
Y2 - 25 June 2017 through 30 June 2017
ER -