log in  |  register  |  feedback?  |  help  |  web accessibility
Secure Computation: From Theory to Practice and Back Again
Jonathan Katz
IRB 4105
Tuesday, February 25, 2020, 11:00 am-12:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Protocols for secure multi-party computation (MPC) allow a collection of mutually distrusting parties to compute a function of their private inputs without revealing anything else about their inputs to each other. Secure computation was shown to be feasible 35 years ago, but only in the past decade has its efficiency been improved to the point where it has been implemented and, more recently, begun to be used. This real-world deployment of secure computation suggests new applications and raises new questions. 
This talk will survey some recent work at the intersection of the theory and practice of MPC. First, I will describe a surprising application of secure computation to the construction of Picnic, a "post-quantum" signature scheme currently under consideration by NIST for standardization. Next, I will discuss work -- motivated by insecure practices in existing libraries for secure computation -- that explores efficient and sound ways of instantiating hash functions in MPC protocols.

Jonathan Katz currently holds the position of Eminent Scholar in Cybersecurity at George Mason University. Prior to that, he was a proud faculty member in the computer science department at the University of Maryland where he also served as director of the Maryland Cybersecurity Center. He is an IACR Fellow, and received the ACM SIGSAC Outstanding Contribution Award in 2019.

This talk is organized by Richa Mathur