Visit ShanghaiTech University | 中文 | How to find us
HOME > News and Events > Seminars
Channels with Synchronization Errors: Light-Weight Secrecy - A Possible Practical Application
Date: 2016/10/13             Browse: 262
Seminar Topic: Channels with Synchronization Errors: Light-Weight Secrecy - A Possible Practical Application

Speaker:  Prof. Aleksandar Kavcic
Time: Oct. 13, 3:30 p.m. - 4:30 p.m.
Venue: Room 204, H2 Building
 
Abstract:
In this talk we consider channels with synchronization errors such as the deletion channel, or the insertion channel, or any combination of deletions/insertions/substitutions. The talk is divided into two parts. In the first part, we review the state of the art in evaluating capacities of channels with synchronization errors. While the general formula for the channel capacity is known (due to Dobrushin’s 1967 work), neither a closed-form solution nor a good numerical method for evaluating the capacity is known. Here, we consider a trellis-based framework as a novel approach, and demonstrate that it can deliver the best known lower bounds on capacities of arbitrary channels with synchronization errors. We also discuss upper bounding possibilities. In the second part of the talk, we deal with the practical aspects of these channels. While insertion/deletion channels are theoretically easy to describe, one drawback is that, in practice, they are mostly man-made channels, so they do not exist as “real” communication channels in the classical sense. However, since they are easily emulated, we argue that a possible practical application may be in achieving light-weight secrecy, i.e., secrecy in extremely low-power regimes (such as low-power network applications). The channel implementation simplicity seems to naturally lend itself to light-weight security solutions. In this talk, we take the insertion channel as the running example and discuss several secrecy modes of operation. While all modes of operation seem promising, deriving performance guarantees seems to be very difficult exactly because information-theoretic quantities are difficult to evaluate. However, in one operation mode that we call the “encrypted mode”, we are able to prove a cryptographic secrecy guarantee.     
 
Biography: 
Aleksandar Kavcic (short) received the Dipl. Ing. degree in Electrical Engineering from Ruhr-University, Bochum, Germany in 1993, and the Ph.D. degree in Electrical and Computer Engineering from Carnegie Mellon University in 1998. Since 2007 he has been with the University of Hawaii, Honolulu where he is presently Professor of Electrical Engineering. Prior to 2007, he was in the Division of Engineering and Applied Sciences at Harvard University. He also held-short term visiting and advisory positions at City University of Hong Kong, Chinese University of Hong Kong, Seagate Technology, Read-Rite Corporation, Quantum Corporation and Link-A-Media Devices. Prof. Kavcic received the IBM Partnership Award in 1999 and the NSF CAREER Award in 2000. He is a co-recipient, with X. Ma  and N. Varnica, of the 2005 IEEE Best Paper Award in Signal Processing and Coding for Data Storage. He served on the Editorial Board of the IEEE Transactions on Information Theory as Associate Editor for Detection and Estimation from 2001 to 2004, as Guest Editor of the IEEE Signal Processing Magazine in 2003-2004, and as Guest Editor of the IEEE Journal on Selected Areas in Communications in 2008-2009.  From 2005 until 2007, he was the Chair of the Data Storage Technical Committee of the IEEE Communications Society, and in 2014 was the general co-chair of the IEEE Symposium on Information Theory in Honolulu, Hawaii.

Seminar 16074