Secure Two-Party Computation Is Practical

Benny Pinkas, Thomas Schneider, Nigel Smart, Stephen Williams

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

240 Citations (Scopus)

Abstract

Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few implementations with which to test various ideas. This has led to a number of optimisations being proposed which are quite restricted in their application. In this paper we describe an implementation of the two-party case, using Yao’s garbled circuits, and present various algorithmic protocol improvements. These optimisations are analysed both theoretically and empirically, using experiments of various adversarial situations. Our experimental data is provided for reasonably large circuits, including one which performs an AES encryption, a problem which we discuss in the context of various possible applications.
Translated title of the contributionSecure Two-Party Computation Is Practical
Original languageEnglish
Title of host publicationAdvances in Cryptology -- ASIACRYPT 2009
PublisherSpringer Berlin Heidelberg
Pages250-267
Volume5912
ISBN (Print)9783642103650
DOIs
Publication statusPublished - 2009

Bibliographical note

Other page information: 250-267
Conference Proceedings/Title of Journal: Advances in Cryptology -- ASIACRYPT 2009
Other identifier: 2001109

Fingerprint Dive into the research topics of 'Secure Two-Party Computation Is Practical'. Together they form a unique fingerprint.

Cite this