Paper 2013/046 Original: eprint.iacr.org/2013/046 ↗
Fast and Maliciously Secure Two-Party Computation Using the GPU
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2013-12-30: last updated
- 2013-01-30: published
- Short URL
- https://ia.cr/2013/046
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2013/046}
}