TY - JOUR
T1 - Secure and Robust Identification via Classical-Quantum Channels
JF - IEEE Transactions on Information Theory
Y1 - 2019
A1 - Boche, Holger
A1 - Deppe, Christian
A1 - Winter, Andreas
VL - 65
UR - https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18https://ieeexplore.ieee.org/document/8731894/http://xplorestaging.ieee.org/ielx7/18/8836351/08731894.pdf?arnumber=8731894
JO - IEEE Trans. Inform. Theory
ER -
TY - CHAP
T1 - Identification via Quantum Channels
T2 - Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede
Y1 - 2013
A1 - Winter, Andreas
ED - Aydinian, Harout
ED - Cicalese, Ferdinando
ED - Deppe, Christian
JF - Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
CY - Berlin, Heidelberg
VL - LNCS 7777
SN - 978-3-642-36899-8
ER -
TY - CONF
T1 - {Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy}
T2 - {2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)}
Y1 - 0
A1 - Boche, Holger
A1 - Deppe, Christian
A1 - Noetzel, Janis
A1 - Winter, Andreas
AB - {We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithmic in the block length, via a quantum version of the ``elimination of of correlation{''} using a random matrix tail bound. This implies a dichotomy theorem: either the classical capacity of the QAVC is zero, and then also the quantum capacity is zero, or each capacity equals its random coding variant.}
JF - {2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)}
T3 - {IEEE International Symposium on Information Theory}
PB - {IEEE; IEEE Informat Theory Soc; NSF; Huawei; Qualcomm}
SN - {978-1-5386-4781-3}
N1 - {IEEE International Symposium on Information Theory (ISIT), Vail, CO, JUN 17-22, 2018}
ER -
TY - CONF
T1 - {Secure and Robust Identification via Classical-Quantum Channels}
T2 - {2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)}
Y1 - 0
A1 - Boche, Holger
A1 - Deppe, Christian
A1 - Winter, Andreas
AB - {We study the identification capacity of classical-quantum channels ({''}cq-channels{''}), under channel uncertainty and privacy constraints. To be precise, we consider first compound memoryless cq-channels and determine their identification capacity; then we add an eavesdropper, considering compound memoryless wiretap cqq-channels, and determine their secret identification capacity. In the first case (without privacy), we find the identification capacity always equal to the transmission capacity. In the second case, we find a dichotomy: either the secrecy capacity (also known as private capacity) of the channel is zero, and then also the secrecy identification capacity is zero, or the secrecy capacity is positive and then the secrecy identification capacity equals the transmission capacity of the main channel without the wiretapper. We perform the same analysis for the case of arbitrarily varying wiretap cqq-channels (cqq-AVWC), with analogous findings, and make several observations regarding the continuity and super-additivity of the identification capacity in the latter case.}
JF - {2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)}
T3 - {IEEE International Symposium on Information Theory}
PB - {IEEE; IEEE Informat Theory Soc; NSF; Huawei; Qualcomm}
SN - {978-1-5386-4781-3}
N1 - {IEEE International Symposium on Information Theory (ISIT), Vail, CO, JUN 17-22, 2018}
ER -