Cryptology ePrint Archive: Report 2009/314

Secure Two-Party Computation is Practical

B. Pinkas and T. Schneider and N.P. Smart and S. Williams

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.

Category / Keywords:

Date: received 27 Jun 2009, last revised 2 Sep 2009

Contact author: nigel at cs bris ac uk

Available format(s): PDF | BibTeX Citation

Version: 20090902:075811 (All versions of this report)

Short URL: ia.cr/2009/314