Fairplay - A secure two-party computation system

Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella

Research output: Contribution to conferencePaperpeer-review

620 Scopus citations


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.

Original languageAmerican English
StatePublished - 2004
Event13th USENIX Security Symposium - San Diego, United States
Duration: 9 Aug 200413 Aug 2004


Conference13th USENIX Security Symposium
Country/TerritoryUnited States
CitySan Diego

Bibliographical note

Publisher Copyright:
© 2000 by The USENIX Association All Rights Reserved.


Dive into the research topics of 'Fairplay - A secure two-party computation system'. Together they form a unique fingerprint.

Cite this