Implementing Secure Multi-Party Computation
Speaker: Benny Pinkas , University of Haifa
Date: October 31 2008
Time: 10:30AM to 12:00PM
Location: 32-G449, Patil/Kiva
Contact: be, 3-6098, email@example.com
Secure computation is one of the great achievements of modern cryptography, enabling a set of untrusting parties to compute any function of their private inputs while revealing nothing but the result of the function. Advances in modern cryptography coupled with rapid growth in processing and communication speeds make secure computation a realistic paradigm. This was demonstrated by the Fairplay system, which is a generic system for secure two-party computation that supports high-level specification of the computation.
We will describe in this talk two recent advances in implementing secure computation. The first is a system for secure two-party computation which has fully-simulatable security against malicious adversaries. Experiments with this system reveal interesting results about the overhead of different parts of the computation, and about the efficiency of using components which are secure in the standard model.
We also present FairplayMP (for "Fairplay Multi-Party"), a system for multi-party computation secure against semi-honest adversaries. The underlying protocol of FairplayMP is the Beaver-Micali-Rogaway (BMR) protocol, which is modified in order to improve its efficiency. This protocol was chosen since it runs in a constant number of communication rounds. We also report on different experiments which measure the effect of different parameters on the performance of the system and demonstrate its scalability.
Based on joint work with Yehuda Lindell and Nigel Smart, and with Assaf Ben-David and Noam Nisan.
See other events that are part of CIS/Microsoft Seminars 2008/2009
See other events happening in October 2008