BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Pairing-based succinct non-interactive zero-knowledge arguments - 
 Groth\, J (UCL)
DTSTART:20120411T103000Z
DTEND:20120411T113000Z
UID:TALK37405@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:A non-interactive zero-knowledge argument enables a prover to 
 convince a verifier that a statement is true without revealing any other p
 rivate information. We consider succinct arguments that are smaller than t
 he size of the statement.  Succinct arguments are known in the random orac
 le model. The goal of this talk is to present alternative pairing-based me
 thods that can be used instead of the random oracle model relying on diffe
 rent and perhaps more plausible cryptographic assumptions.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR