Getting more out of secure computation
Monday, November 18, 2013 - 4:00pm - 4:50pm
KEC 1001
Mike Rosulek
Assistant Professor
School of EECS
Oregon State University
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 introduce some main concepts from secure
computation and describe recent work aimed at making secure computation protocols more
realistic and practical.
Speaker Biography:
Mike Rosulek is an Assistant Professor in the School of EECS at Oregon State University. 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.
_______________________________________________
Colloquium mailing list
[email protected]
https://secure.engr.oregonstate.edu/mailman/listinfo/colloquium
