BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Data compression and secrecy by design
DTSTART:20181212T141500
DTEND:20181212T151500
DTSTAMP:20260406T185230Z
UID:4764422719a386cbf05dfd238b2d5ef37b9106a44dd8e904342edd9b
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dr. Yanina Shkel\, Princeton   Yanina Shkel is a research sch
 olar in the department of Electrical Engineering at Princeton University. 
 Yanina has B.S. degrees in Mathematics and in Computer Science\, as well a
 s a Ph.D. degree in Electrical and Computer Engineering from University of
  Wisconsin-Madison. Before attending graduate school she worked as a devel
 oper for Morningstar\, Inc. where she administered databases containing an
 d processing large amounts of financial data. More recently\, she was an i
 ntern at 3M Corporate Research Labs where she had a unique opportunity to 
 apply her background in computation and information sciences for materials
  and product driven needs of 3M. Yanina is a recipient of the NSF Center f
 or Science of Information (CSoI) postdoctoral fellowship.\nThe unique char
 acteristics of the IoT make it very challenging to provide adequate securi
 ty primitives. The complexity of traditional cryptographic methods is an i
 ssue for IoT applications that have very stringent delay requirements. Mor
 eover\, in the context of the IoT\, security requirements and the explicit
  applications have to be taken into account from the beginning of the prot
 ocol design. Motivated by these unique characteristics of the IoT systems\
 , we\nintroduce the framework of secrecy by design as an approach to parti
 al information-theoretic secrecy. The main idea behind secrecy by design i
 s to begin with an operational secrecy constraint\, which is modeled by a 
 secrecy function\, and then to derive fundamental limits for the performan
 ce of the resulting secrecy system. In the setting of lossless compression
 \, we show that strong information-theoretic secrecy guarantees can be ach
 ieved using a reduced\nsecret key size and a modular two-part coding strat
 egy. Moreover\, the proposed two-part codes possess a universality propert
 y that has an immediate implication for secure inference. Time permitting\
 , we will also discuss connections between secrecy by design and related\n
 notions such as randomness extraction and common information.
LOCATION:INM 201 https://plan.epfl.ch/?room=INM201
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR