15th Estonian Winter School in Computer Science (EWSCS)
XV Eesti Arvutiteaduse Talvekool

Palmse, Estonia, February 28 -March 5, 2010

Jens Groth

Department of Computer Science
University College London
United Kingdom

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.

Course materials

Valid CSS! Valid XHTML 1.0 Strict Last changed March 10, 2010 11:21 EET by local organizers, ewscs10(at)cs.ioc.ee
EWSCS'10 page: http://cs.ioc.ee/ewscs/2010/