BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Computer Security Seminars
SUMMARY:Efficient Zero-Knowledge Proofs - with applicatio
ns to voting and for general purpose use - Jens Gr
oth (UCL)
DTSTART:20180301T110000Z
DTEND:20180301T120000Z
UID:TALK3031AT
URL:/talk/index/3031
DESCRIPTION:Abstract:\n\nA zero-knowledge proof enables a prov
er to convince a verifier that a given statement i
s true. Zero knowledge means that the proof only c
onveys the fact that the statement is true but rev
eals no other private information to the verifier\
, i.e.\, he does not learn why the statement is tr
ue.\n\nI will give a gentle introduction to zero-k
nowledge proofs using internet voting schemes and
mix-nets for anonymous broadcast as motivating exa
mples. Then in the second half I will discuss zero
-knowledge proofs for general purpose use in the f
orm or arithmetic circuit satisfiability and recen
t advances that have made zero-knowledge proofs hi
ghly efficient.\n\nBio:\n\nJens Groth received his
PhD in Computer Science from Aarhus University in
Denmark. Afterwards he did a Post-Doc at Universi
ty of California Los Angeles\, where he received t
he 2007 UCLA Chancellor's Award for Postdoctoral R
esearch. He is now Professor of Cryptology in the
Department of Computer Science at University Colle
ge London and the Director of UCL's Academic Centr
e of Excellence in Cyber Security Research. His re
search interests include electronic voting\, anony
mization protocols\, advanced digital signatures\,
public-key encryption and zero-knowledge proofs.
He is among the 20 most published authors worldwid
e at the top cryptology conferences ASIACRYPT\, EU
ROCRYPT and CRYPTO over the last decade.
LOCATION:Computer Science\, The Sloman Lounge (UG)
CONTACT:Dr Garfield Benjamin
END:VEVENT
END:VCALENDAR