Technical University of Munich, Germany
Randomness as a Resource in Modern Communication and Information Systems
Video recording available for Signal Processing Society Members
Wednesday, 13 June
09:00 – 10:00
We consider basic questions in information and communication theory on the value of randomness as a resource.
We start with Shannon´s problem of transmission of messages over noisy channels. Shannon’s famous solution of this problem was one of the starting points of our information society. Shannon used deterministic encoding and decoding of messages. It is clear that randomized encoding and decoding cannot increase the Shannon capacity for message transmission over noisy channels. Even if we use common randomness between the transmitter and receiver, it is not possible to increase the Shannon capacity for message transmission. As a next step, we consider the problem of secure message transmission of wiretap channels. In this case we discuss that it is already necessary to use local randomness at the transmitter to achieve the capacity for secure message transmission. We further discuss the problem of message transmission and secure message transmission of noisy channels with jammers. For these type of channels, local randomness at the transmitter is a very important resource that increases the capacity and stabilizes the communication from the transmitter to the receiver. In the second part of the talk we will introduce the communication task of identification. In the identification task, the receiver is interested in testing whether a specific message has been transmitted. The transmitter has no idea which message is interesting to the receiver. The identification task is very important for new applications, e.g. car to car, car to infrastructure, sensor networks, and for the tactile internet. If we only use deterministic encoding and decoding, then the capacity for identification over noisy channels is equal to the Shannon capacity for message transmission. So the number of messages that the receiver can identify grows exponentially with the block length. The situation changes dramatically if we can use local randomness at the transmitter. In this case we will show that the number of messages that the receiver can correctly identify grows doubly exponentially. We will show that the same is true for the secure identification task. We will extend this to the identification of noisy channels with a jammer. Here additional gains can be achieved by using a common randomness transmitter and receiver. We will further discuss storage of data and secure storage of private data on public databases. At the end of the talk we will discuss applications for big data.
This is joint work with Christian Deppe from TU Munich-LNT.
Holger Boche is a Professor in the Institute of Theoretical Information Technology at the Technische Universität München, Munich, Germany.
Holger Boche received the Dipl.-Ing. and Dr.-Ing. degrees in electrical engineering from the Technische Universität Dresden, Dresden, Germany, in 1990 and 1994, respectively. He graduated in mathematics from the Technische Universität Dresden in 1992. From 1994 to 1997, he did Postgraduate studies in mathematics at the Friedrich-Schiller Universität Jena, Jena, Germany. He received his Dr. rer. nat. degree in pure mathematics from the Technische Universität Berlin, Berlin, Germany, in 1998. In 1997, he joined the Heinrich-Hertz-Institut (HHI) für Nachrichtentechnik Berlin, Berlin, Germany.
Starting in 2002, he was a Full Professor for mobile communication networks with the Institute for Communications Systems, Technische Universität Berlin. In 2003, he became Director of the Fraunhofer German-Sino Lab for Mobile Communications, Berlin, Germany, and in 2004 he became the Director of the Fraunhofer Institute for Telecommunications (HHI), Berlin, Germany. Since October 2010 he has been with the Institute of Theoretical Information Technology and Full Professor at the Technische Universität München, Munich, Germany. Since 2014 he has been a member and honorary fellow of the TUM Institute for Advanced Study, Munich, Germany. He was a Visiting Professor with the ETH Zurich, Zurich, Switzerland, during the 2004 and 2006 Winter terms, and with KTH Stockholm, Stockholm, Sweden, during the 2005 Summer term.
Prof. Boche is a Member of IEEE Signal Processing Society SPCOM and SPTM Technical Committee. He was elected a Member of the German Academy of Sciences (Leopoldina) in 2008 and of the Berlin Brandenburg Academy of Sciences and Humanities in 2009. He received the Research Award ”Technische Kommunikation” from the Alcatel SEL Foundation in October 2003, the ”Innovation Award” from the Vodafone Foundation in June 2006, and the Gottfried Wilhelm Leibniz Prize from the Deutsche Forschungsgemeinschaft (German Research Foundation) in 2008. He was co-recipient of the 2006 IEEE Signal Processing Society Best Paper Award and recipient of the 2007 IEEE Signal Processing Society Best Paper Award. He was the General Chair of the Symposium on Information Theoretic Approaches to Security and Privacy at IEEE GlobalSIP 2016. Among his publications is the recent book Information Theoretic Security and Privacy of Information Systems (Cambridge University Press).