Computation Research in Boston and Beyond Seminar
Friday, October 06, 2017 at 12:00pm to 1:00pm
Stata - Room 32-D463
SPEAKERS: Miriam Leeser and Stratis Ioannidis
TITLE: Practical, Secure Function Evaluation at Scale
ABSTRACT:
Secure Function Evaluation (SFE) allows an interested party to evaluate a function over private data without learning anything about the inputs other than the outcome of this computation. This offers a strong privacy guarantee: SFE enables, e.g., a medical researcher, a statistician, or a data analyst, to conduct a study over private, sensitive data, without jeopardizing the privacy of the study's participants (patients, online users, etc.). Nevertheless, applying SFE to “big data” poses several challenges. First, beyond any computational overheads due to encryptions, executing an algorithm securely may lead to a polynomial blowup in the total work compared to execution in the clear. Second, secure evaluations of algorithms should maintain parallelizability: an algorithm that is easy to parallelize in the clear should also maintain this property in its SFE version, if its execution is to scale.
In this talk, we describe Garbled Circuits (GCs), a technique for implementing SFE that can be applied to any problem that can be described as a Boolean circuit. We then describe recent advances in the parallel execution of GCs for several machine learning algorithms such as page rank, matrix factorization, and training neural networks. We address issues of scalability both by running GCs on clusters of machines as well as applying FPGAs in the datacenter to accelerate the processing.
- Event Type
- Events By Interest
- Events By Audience
- Events By School
- Department
- Department of Mathematics
- Add to my calendar
Recent Activity
No recent activity