Secure Two-Party Computation Is Practical

Benny Pinkas; Thomas Schneider; Nigel Smart; Stephen Williams

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

Secure Two-Party Computation Is Practical

Benny Pinkas, Thomas Schneider, Nigel Smart, Stephen Williams

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

318 Citations (Scopus)

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.

Translated title of the contribution	Secure Two-Party Computation Is Practical
Original language	English
Title of host publication	Advances in Cryptology -- ASIACRYPT 2009
Publisher	Springer Berlin Heidelberg
Pages	250-267
Volume	5912
ISBN (Print)	9783642103650
DOIs	https://doi.org/10.1007/978-3-642-10366-7_15
Publication status	Published - 2009

Bibliographical note

Other page information: 250-267
Conference Proceedings/Title of Journal: Advances in Cryptology -- ASIACRYPT 2009
Other identifier: 2001109

Access to Document

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

http://link.springer.com/chapter/10.1007%2F978-3-642-10366-7_15

Handle.net

Persistent link

Cite this

@inproceedings{ea46e566741f448bbaf573b9249d179c,

title = "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{\textquoteright}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. ",

author = "Benny Pinkas and Thomas Schneider and Nigel Smart and Stephen Williams",

note = "Other page information: 250-267 Conference Proceedings/Title of Journal: Advances in Cryptology -- ASIACRYPT 2009 Other identifier: 2001109",

year = "2009",

doi = "10.1007/978-3-642-10366-7_15",

language = "English",

isbn = "9783642103650",

volume = "5912",

pages = "250--267",

booktitle = "Advances in Cryptology -- ASIACRYPT 2009",

publisher = "Springer Berlin Heidelberg",

address = "Germany",

}

TY - GEN

T1 - Secure Two-Party Computation Is Practical

AU - Pinkas, Benny

AU - Schneider, Thomas

AU - Smart, Nigel

AU - Williams, Stephen

N1 - Other page information: 250-267 Conference Proceedings/Title of Journal: Advances in Cryptology -- ASIACRYPT 2009 Other identifier: 2001109

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-72449131818&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10366-7_15

DO - 10.1007/978-3-642-10366-7_15

M3 - Conference Contribution (Conference Proceeding)

SN - 9783642103650

VL - 5912

SP - 250

EP - 267

BT - Advances in Cryptology -- ASIACRYPT 2009

PB - Springer Berlin Heidelberg

ER -

Secure Two-Party Computation Is Practical

Abstract

Bibliographical note

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this