BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Foundations of Garbled Circuits - Rogaway\, P (UC\, Davis)
DTSTART:20120411T080000Z
DTEND:20120411T090000Z
UID:TALK37412@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Garbled circuits\, a classical idea rooted in the work of A. Y
 ao\, have generally been understood as a cryptographic *technique*\, not a
  cryptographic *goal*. Here we treat garbled circuits as a proper cryptogr
 aphic primitive\, giving a syntax for a "garbling scheme" and formalizing 
 several security notions for such schemes. The most basic of our notions\,
  "privacy"\, suffices for the classical goals of two-party secure function
  evaluation (SFE) and private function evaluation (PFE). We provide a simp
 le and efficient garbling scheme achieving privacy\, this built from a blo
 ck cipher\, and we analyze its concrete security. We next consider the "au
 thenticity" and "obliviousness" of a garbling scheme\, extending the block
 cipher-based protocol to achieve these ends\, too. Our treatment of garbli
 ng schemes solidifies notions that have been swirling around the literatur
 e for years\, and promises a more modular approach to designing and using 
 garbling sc hemes in the future.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR