International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2009: Advances in Cryptology – ASIACRYPT 2009 pp 250-267

Secure Two-Party Computation Is Practical

  • Benny Pinkas
  • Thomas Schneider
  • Nigel P. Smart
  • Stephen C. Williams
Conference paper

DOI: 10.1007/978-3-642-10366-7_15

Volume 5912 of the book series Lecture Notes in Computer Science (LNCS)

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Benny Pinkas
    • 1
  • Thomas Schneider
    • 2
  • Nigel P. Smart
    • 3
  • Stephen C. Williams
    • 3
  1. 1.Dept. of Computer ScienceUniversity of HaifaHaifaIsrael
  2. 2.Horst Görtz Institute for IT-SecurityRuhr-University BochumBochumGermany
  3. 3.Dept. Computer ScienceUniversity of BristolBristolUnited Kingdom