Proving Anything Quickly, Privately, and Elegantly with Secure Computation
Author(s)
Kolesnikov, Vladimir
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
Abstract
Secure multi-party computation (MPC) is an area of cryptography which studies computing on encrypted data. In this talk, I will discuss a somewhat surprising MPC technique of proving statements in zero-knowledge (i.e., without revealing anything beyond the proof’s validity) and without interaction (i.e., the prover can simply send the proof, together with the claim). Non-interactive zero-knowledge (NIZK) proofs have been recently popularized by their applications to blockchain.
I will present recent work (produced jointly with Jonathan Katz and Xiao Wang at the University of Maryland) which improves the sizes of the proofs, and which is under consideration by the National Institute of Standards & Technology as the standard on post-quantum signatures.
No prior cryptography knowledge will be required for this talk.
Sponsor
Date
2018-08-24
Extent
61:48 minutes
Resource Type
Moving Image
Resource Subtype
Lecture