Richard M. Karp Distinguished Lecture — Secure Multiparty Computation

How can sensitive data be processed without introducing a single point of failure? How can several parties perform a joint computation on their secret inputs, say add them up or compute some other statistics, without revealing any additional information to each other except the desired output?  

Secure multiparty computation is a powerful cryptographic tool for solving this kind of problem. The talk will give an overview of research in the area, covering classical results, connections with other problems, current research directions, and remaining challenges.

Light refreshments will be served before the lecture at 3:30 p.m.