%0 Journal Article
%J IEEE Transactions on Information Theory
%D 2019
%T Secure and Robust Identification via Classical-Quantum Channels
%A Boche, Holger
%A Deppe, Christian
%A Winter, Andreas
%B IEEE Transactions on Information Theory
%V 65
%P 6734 - 6749
%8 Jan-10-2019
%U 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
%! IEEE Trans. Inform. Theory
%R 10.1109/TIT.1810.1109/TIT.2019.2920952
%0 Book Section
%B Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede
%D 2013
%T Identification via Quantum Channels
%A Winter, Andreas
%E Aydinian, Harout
%E Cicalese, Ferdinando
%E Deppe, Christian
%B Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede
%S Lecture Notes in Computer Science
%I Springer Berlin Heidelberg
%C Berlin, Heidelberg
%V LNCS 7777
%P 217 - 233
%@ 978-3-642-36899-8
%R 10.1007/978-3-642-36899-8_9
%0 Conference Paper
%B {2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)}
%D 0
%T {Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy}
%A Boche, Holger
%A Deppe, Christian
%A Noetzel, Janis
%A Winter, Andreas
%X {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.}
%B {2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)}
%S {IEEE International Symposium on Information Theory}
%I {IEEE; IEEE Informat Theory Soc; NSF; Huawei; Qualcomm}
%P {2012-2016}
%@ {978-1-5386-4781-3}
%0 Conference Paper
%B {2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)}
%D 0
%T {Secure and Robust Identification via Classical-Quantum Channels}
%A Boche, Holger
%A Deppe, Christian
%A Winter, Andreas
%X {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.}
%B {2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)}
%S {IEEE International Symposium on Information Theory}
%I {IEEE; IEEE Informat Theory Soc; NSF; Huawei; Qualcomm}
%P {2674-2678}
%@ {978-1-5386-4781-3}