BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Efficient Smooth Projective Hash Functions and Applications - Poin
 tcheval\, D (ENS - Paris)
DTSTART:20120412T103000Z
DTEND:20120412T113000Z
UID:TALK37431@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:In 2008\, Groth and Sahai proposed a powerful suite of techniq
 ues for constructing non-interactive zero-knowledge proofs in bilinear gro
 ups. Their proof systems have found numerous applications\, including grou
 p signature schemes\, anonymous voting\, and anonymous credentials.\n \nIn
  this talk\, we demonstrate that the notion of smooth projective hash func
 tions is an efficient alternative for interactive protocols. We show that 
 this approach provides suitable proofs for designing schemes that rely on 
 standard security assumptions in the standard model with a common-referenc
 e string and are more efficient than those obtained using the Groth-Sahai 
 methodology when interactions are already required by the primitive itself
 .\n \nAs an illustration of our design principle\, we describe efficient b
 lind signature schemes\, as well as an oblivious signature-based envelope 
 scheme\, but also the new notion of Language-based Authenticated Key Excha
 nge\, that includes Password-based Authenticated Key Exchange\, Secret Han
 dshakes and Credential Authenticated Key Exchange.\n \nThis is a joint wor
 k with Olivier Blazy\, Cline Chevalier and Damien Vergnaud. \n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR