Faster Maliciously Secure Two-Party Computation Using the GPU

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.

DOI: 10.1007/978-3-319-10879-7_21

Extracted Key Phrases

12 Figures and Tables

051015201520162017
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Frederiksen2014FasterMS, title={Faster Maliciously Secure Two-Party Computation Using the GPU}, author={Tore Kasper Frederiksen and Thomas P. Jakobsen and Jesper Buus Nielsen}, booktitle={IACR Cryptology ePrint Archive}, year={2014} }