Cryptology ePrint Archive: Report 2014/270
Faster Maliciously Secure Two-Party Computation Using the GPU
Tore Kasper Frederiksen and Thomas Pelle Jakobsen and Jesper Buus Nielsen
Abstract: We present a new protocol for maliciously secure two-party computation based on cut-and-choose of garbled circuits using the recent idea of “forge-and-loose”, which eliminates around a factor 3 of garbled circuits that needs to be constructed and evaluated. Our protocol introduces a new way to realize the “forge-and-loose” approach, which avoids an auxiliary secure two-party computation protocol, does not rely on any number theoretic assumptions and parallelizes well in a same instruction, multiple data (SIMD) framework.
With this approach we prove our protocol universally composable secure against a malicious adversary assuming access to oblivious transfer, commitment and coin-tossing functionalities in the random oracle model.
Finally, we construct, and benchmark, a SIMD implementation of this protocol using a GPU as a massive SIMD device. The findings compare favorably with all previous implementations of maliciously secure, two-party computation.
Category / Keywords: cryptographic protocols, implementation, secure two-party computation, garbled circuits
Original Publication (with minor differences): SCN 2014
Date: received 17 Apr 2014, last revised 11 May 2015
Contact author: jot2re at cs au dk
Available format(s): PDF | BibTeX Citation
Version: 20150511:155621 (All versions of this report)
Short URL: ia.cr/2014/270
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]