Secure Two-Party Computation Is Practical

  • Authors:
  • Benny Pinkas;Thomas Schneider;Nigel P. Smart;Stephen C. Williams

  • Affiliations:
  • Dept. of Computer Science, University of Haifa, Haifa, Israel 31905;Horst Görtz Institute for IT-Security, Ruhr-University Bochum, Bochum, Germany D-44780;Dept. Computer Science, University of Bristol, Bristol, United Kingdom BS8 1UB;Dept. Computer Science, University of Bristol, Bristol, United Kingdom BS8 1UB

  • Venue:
  • ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.