You are looking at a specific version 20130429:093452 of this paper. See the latest version.

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 secure two-party computation, based on Yao's garbled circuit and an efficient OT extension, in a parallel computational model. The implementation is done using CUDA and yields the fastest results for maliciously secure two-party computation in a realistic and practical setting by using a simple consumer grade CPU and GPU. Our protocol further introduces some novel constructions in order to combine garbled circuits and an OT extension in a parallel and maliciously secure setting.

Note: Updated accordingly to the peer feedback of the extended abstract version.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
implementationtwo-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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.