Fast and Maliciously Secure Two-Party Computation Using the GPU

Tore Kasper Frederiksen; Jesper Buus Nielsen

Paper 2013/046

Fast and Maliciously Secure Two-Party Computation Using the GPU

Tore Kasper Frederiksen and Jesper Buus Nielsen

Abstract

We describe, and implement, a maliciously secure protocol for two-party computation in a parallel computational model. The protocol is based on cut-and-choose of Yao’s garbled circuit and an efficient oblivious transfer extension. The implementation is done using CUDA and yields fast results in a financially feasible and practical setting by using a consumer grade CPU and GPU. Our protocol introduces a novel construction in order to verify consistency of the garbled circuit constructor’s input in a parallel and maliciously secure setting.

Note: A bug was found and some rewriting of the protocol was needed along with a new set of tests.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Major revision. ACNS
DOI: 10.1007/978-3-642-38980-1_21
Keywords: implementation two-party computation
Contact author(s): jot2re @ cs au dk
History: 2013-12-30: last of 8 revisions; 2013-01-30: received; See all versions
Short URL: https://ia.cr/2013/046
License: CC BY

BibTeX

@misc{cryptoeprint:2013/046,
      author = {Tore Kasper Frederiksen and Jesper Buus Nielsen},
      title = {Fast and Maliciously Secure Two-Party Computation Using the {GPU}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/046},
      year = {2013},
      doi = {10.1007/978-3-642-38980-1_21},
      url = {https://eprint.iacr.org/2013/046}
}