Getting More out of Secure Computation
Friday, February 8, 2013 - 10:00am - 11:10am
KEC 1007
Mike Rosulek
Assistant Professor
Department of Computer Science
University of Montana
Abstract:
"Secure computation" allows a group of parties to carry out a computation on
their combined private inputs, and learn only the outcome of the computation. This idea
encompasses a wide range of problems such as elections, auctions, private data mining,
zero-knowledge proofs; and it has led to many beautiful results in cryptography since its
inception 30 years ago.
In this talk, I will describe recent work on secure computation that is aimed
at making secure computation more realistic and practical. I will also discuss
a vision for new cryptographic tools that will yield further improvements. The
talk will be accessible to non-cryptographers.
Speaker Biography:
Mike Rosulek is an Assistant Professor in the Department of Computer Science at the University of Montana. He earned a Ph.D. in Computer Science from the University of Illinois and a B.S. in Computer Science from Iowa State University. His research interests are in cryptography, focusing on secure computation protocols and computing on encrypted data. His research was recently recognized with the NSF's prestigious CAREER award for junior faculty.
_______________________________________________
Colloquium mailing list
[email protected]
https://secure.engr.oregonstate.edu/mailman/listinfo/colloquium
