Secure Two-Party Computation is Practical

ePrint Report: Secure Two-Party Computation is Practical

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

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 …

application area case community computation eprint report ideas led party protocol report restricted schneider smart test williams