Campus Event Calendar
Event Entry
What and Who
Trading Privacy for Communication
Lila Fontes
LIAFA, Université Paris Diderot
AG1 Mittagsseminar (own work)
AG 1, SWS, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 28 July 2015
13:00
30 Minutes
Warning: Title has changed!
E1 4
024
Saarbrücken
Abstract
The study of information-theoretic privacy in communication settings is ancient by computer science standards. Since 1989 we have known that most interesting functions are not privately computable at all. This unattainability of privacy motivates the more recent study of approximate privacy. When can privacy be partially sacrificed, and how do we measure such relaxations?
This talk will present an introduction to the material and then show a tight bound on the tradeoff between privacy and communication. This result means that Alice and Bob can choose one parameter to fix (privacy loss or communication length) and our parametrized algorithm will yield the optimal performance on the other parameter. This work made a nice connection to information complexity, which will be elucidated if time permits.
Contact
Holger Dell
--email hidden
passcode not visible
logged in users only
Holger Dell, 07/23/2015 13:22
Holger Dell, 07/10/2015 18:56 -- Created document.
Holger Dell, 07/10/2015 18:56 -- Created document.