Paper 2009/314 Original: eprint.iacr.org/2009/314 ↗
Secure Two-Party Computation is Practical
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- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-04-11: last updated
- 2009-07-01: published
- Short URL
- https://ia.cr/2009/314
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2009/314}
}