|
13th USENIX Security Symposium — Abstract
Pp. 287–302 of the Proceedings
Awarded Best Student Paper!
Fairplay—A Secure Two-Party Computation System
Dahlia Malkhi and Noam Nisan, Hebrew University; Benny Pinkas, HP Labs; Yaron Sella, Hebrew University
Abstract
Advances in modern cryptography coupled with rapid growth in processing and
communication speeds make secure two-party computation a realistic paradigm.
Yet, thus far, interest in this paradigm has remained mostly theoretical.
This paper introduces Fairplay [28], a full-fledged system that implements
generic secure
function evaluation (SFE). Fairplay comprises a high level procedural
definition language called SFDL tailored to the SFE paradigm; a compiler of
SFDL into a one-pass Boolean circuit presented in a language called SHDL;
and Bob/Alice programs that evaluate the SHDL
circuit in the manner suggested by Yao in [39].
This system enables us to present the first evaluation of an overall SFE in
real settings, as well as examining its components and identifying potential
bottlenecks. It provides a test-bed of ideas and enhancements concerning SFE,
whether by replacing parts of it, or by integrating with it. We exemplify its
utility by examining several alternative implementations of oblivious
transfer within the system, and reporting on their effect on overall
performance.
- View the full text of this paper in HTML and PDF.
The Proceedings are published as a collective work, © 2004 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
|
Need help? Use our Contacts page.
