Efficient Zero-Knowledge Proofs - with applications to voting and for general purpose use

Add to your list(s) Download to your calendar using vCal

• Jens Groth (UCL)
• Thursday 01 March 2018, 11:00-12:00
• Computer Science, The Sloman Lounge (UG).

If you have a question about this talk, please contact Dr Garfield Benjamin.

Abstract:

A zero-knowledge proof enables a prover to convince a verifier that a given statement is true. Zero knowledge means that the proof only conveys the fact that the statement is true but reveals no other private information to the verifier, i.e., he does not learn why the statement is true.

I will give a gentle introduction to zero-knowledge proofs using internet voting schemes and mix-nets for anonymous broadcast as motivating examples. Then in the second half I will discuss zero-knowledge proofs for general purpose use in the form or arithmetic circuit satisfiability and recent advances that have made zero-knowledge proofs highly efficient.

Bio:

Jens Groth received his PhD in Computer Science from Aarhus University in Denmark. Afterwards he did a Post-Doc at University of California Los Angeles, where he received the 2007 UCLA Chancellor’s Award for Postdoctoral Research. He is now Professor of Cryptology in the Department of Computer Science at University College London and the Director of UCL ’s Academic Centre of Excellence in Cyber Security Research. His research interests include electronic voting, anonymization protocols, advanced digital signatures, public-key encryption and zero-knowledge proofs. He is among the 20 most published authors worldwide at the top cryptology conferences ASIACRYPT , EUROCRYPT and CRYPTO over the last decade.

This talk is part of the Computer Security Seminars series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Science, The Sloman Lounge (UG)
• Computer Security Seminars
• computer sience

Note that ex-directory lists are not shown.