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:Recent Advances in Computational Extractors - Kraw
czyk\, H (The Technion\, Israel)
DTSTART;TZID=Europe/London:20120201T090000
DTEND;TZID=Europe/London:20120201T094500
UID:TALK36091AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/36091
DESCRIPTION:Randomness extractors are algorithms that map sour
ces of sufficient min-entropy to outputs that are
statistically close to uniform. Randomness extrac
tion has become a central and ubiquitous notion in
complexity theory and theoretical computer scienc
e with innumerable applications and surprising and
unifying connections to other notions. Cryptogra
phy\, too\, has greatly benefited from this notion
. Cryptographic applications of randomness extract
ors range from the construction of pseudorandom ge
nerators from one-way functions to the design of c
ryptographic functionality from noisy and weak sou
rces (including applications to quantum cryptograp
hy) to the more recent advances in areas such as l
eakage- and exposure-resilient cryptography\, circ
ular encryption\, fully homomorphic encryption\, e
tc.\n Randomness extractors have also found
important cryptographic uses in practical applicat
ions\, particularly for the construction of key de
rivation functions. In many of these applications\
, the defining property of randomness extractors\,
namely\, statistical closeness of their output to
a uniform distribution\, can be relaxed and repla
ced with computational indistinguishability. Extra
ctors that provide this form of relaxed guarantee
are called 'computational extractors'.\n In
this talk I will cover some recent advances in the
understanding and applicability of computational
extractors with particular focus on their role in
building key derivation functions.\n As a c
onnection between this talk and the question 'Is C
ryptographic Theory Practically Relevant?' see htt
p://tools.ietf.org/html/rfc5869.
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:Mustapha Amrani
END:VEVENT
END:VCALENDAR