Secure Multiparty Computation of Approximations: A Survey
Speaker: Martin J. Strauss , University of MichiganContact:
Date: April 29 2008
Time: 4:15PM to 5:30PM
Host: Piotr Indyk, CSAIL
Be Blackburn, 3-6098, firstname.lastname@example.orgRelevant URL: http://theory.csail.mit.edu/theory-seminars/calendar.html
Suppose two or more parties have pieces of a large
database and they want to do joint datamining.
Typically, they will want their computation to be
efficient, at least approximately correct (often exact
computations cannot be performed efficiently), and
private, in the sense that the players do not want to
reveal more information than necessary.
Although approximation algorithms and private
multiparty computation (as well as a stronger notion of
secure multiparty computation) have been studied for
decades, it is not straightforward to combine existing
techniques. We discuss the issues, give a general
framework for secure approximations, and survey some
results in the area.
See other events that are part of Theory Colloquium Spring 2008
See other events happening in April 2008