BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Overcoming Weak Expectations - Dodis\, Y (New York)
DTSTART:20120413T133000Z
DTEND:20120413T143000Z
UID:TALK37465@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Recently\, there has been renewed interest in basing cryptogra
 phic primitives on weak secrets\, where the only information about the sec
 ret is some non-trivial amount of (min-)entropy.  From a formal point of v
 iew\, such results require to upper bound the expectation of some function
  f(X)\, where X is a weak source in question. We show an elementary inequa
 lity which essentially upper bounds such 'weak expectation' by two terms\,
  the first of which is *independent* of f\, while the second only depends 
 on the 'variance' of f under *uniform* distribution. Quite remarkably\, as
  relatively simple corollaries of this elementary inequality\, we obtain s
 ome 'unexpected' results\, in several cases noticeably simplifying/improvi
 ng prior techniques for the same problem. Examples include non-malleable e
 xtractors\, leakage-resilient symmetric encryption\, seed-dependent conden
 sers and improved entropy loss for the leftover hash lemma.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR