BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Overcoming Weak Expectations - Dodis\, Y (New York
)
DTSTART;TZID=Europe/London:20120413T143000
DTEND;TZID=Europe/London:20120413T153000
UID:TALK37465AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/37465
DESCRIPTION:Recently\, there has been renewed interest in basi
ng cryptographic primitives on weak secrets\, wher
e the only information about the secret is some no
n-trivial amount of (min-)entropy. From a formal
point of view\, such results require to upper boun
d the expectation of some function f(X)\, where X
is a weak source in question. We show an elementar
y inequality which essentially upper bounds such '
weak expectation' by two terms\, the first of whic
h is *independent* of f\, while the second only de
pends on the 'variance' of f under *uniform* distr
ibution. Quite remarkably\, as relatively simple c
orollaries of this elementary inequality\, we obta
in some 'unexpected' results\, in several cases no
ticeably simplifying/improving prior techniques fo
r the same problem. Examples include non-malleable
extractors\, leakage-resilient symmetric encrypti
on\, seed-dependent condensers and improved entrop
y loss for the leftover hash lemma.\n
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:Mustapha Amrani
END:VEVENT
END:VCALENDAR