Cryptology ePrint Archive: Report 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.
Category / Keywords: cryptographic protocols / implementation, two-party computation
Original Publication (with major differences): ACNS
Date: received 29 Jan 2013, last revised 30 Dec 2013
Contact author: jot2re at cs au dk
Available format(s): PDF | BibTeX Citation
Note: A bug was found and some rewriting of the protocol was needed along with a new set of tests.
Version: 20131230:111126 (All versions of this report)
Short URL: ia.cr/2013/046
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]