Pairing-based Non-interactive Zero-Knowledge Proofs

Non-interactive zero-knowledge proofs make it possible to prove the truth of a statement without revealing any other information. They have been used widely in the theory of cryptography, but due to efficiency problems have not yet found many practical applications. In this talk, we will cover recent pairing-based constructions of non-interactive zero-knowledge proofs that yield the necessary efficiency for practical applications as well as the possibility to have perfect and everlasting privacy.

Speaker Details

Dr. Jens Groth received his PhD in Computer Science from Aarhus University. He went on to UCLA, where he received the 2007 Chancellor’s Award for Postdoctoral Research. Currently, he is an Assistant Professor in the Computer Science Department of University College London.Dr. Groth is interested in both theoretical cryptography as well as practical applications of cryptographic techniques. His research has included areas such as electronic voting, anonymization, advanced digital signatures, public-key encryption and zero-knowledge proofs.