Paper 2009/314

Secure Two-Party Computation is Practical

B. Pinkas, T. Schneider, 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.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
nigel @ cs bris ac uk
History
2009-09-02: revised
2009-07-01: received
See all versions
Short URL
https://ia.cr/2009/314
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/314,
      author = {B.  Pinkas and T.  Schneider and N. P.  Smart and S.  Williams},
      title = {Secure Two-Party Computation is Practical},
      howpublished = {Cryptology ePrint Archive, Paper 2009/314},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/314}},
      url = {https://eprint.iacr.org/2009/314}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.