BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Meta-Reductions - Fischlin\, M (TU\, Darmstadt)
DTSTART:20120411T090000Z
DTEND:20120411T100000Z
UID:TALK37413@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Meta-Reductions are a technique to show impossiblity results i
 n reductionist cryptography.  Roughly\, such a meta-reduction M shows that
  there cannot exist a reduction R which turns a successful adversary again
 st one cryptographic primitive into a successful adversary against another
 \, hard primitive. This is shown by turning the reduction R  through the m
 eta-reduction M (a 'reduction against the reduction') into an algorithm so
 lving the underlying primitive  directly\, without relying on the assumpti
 on of a successful adversary.  Hence\, either the reduction R cannot exist
  (if the primitive is really hard)\, or it is trivial (if the primitive is
  already easy). Unlike other separation techniques\, meta-reductions usual
 ly work for all reductions R which treat the adversary as a black-box\, bu
 t often do not impose any restriction on  the primitives in question\, i.e
 .\, the primitive may not be treated as a black-box\, and the technique ma
 y thus apply to common primitives like RSA or DL. In return\, all known me
 ta-reductions work for specific primitives only. In this talk we survey th
 e recent result on meta-reductions and shed light on the applicability of 
 this technique.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR