Paper 2016/495
Cross&Clean: Amortized Garbled Circuits with Constant Overhead
Jesper Buus Nielsen and Claudio Orlandi
Abstract
Garbled circuits (GC) are one of the main tools for secure two-party computation. One of the most promising techniques for efficiently achieving active-security in the context of GCs is the so called \emph{cut-and-choose} approach, which in the last few years has received many refinements in terms of the number of garbled circuits which need to be constructed, exchanged and evaluated. In this paper we ask a simple question, namely \emph{how many garbled circuits are needed to achieve active security?} and we propose a novel protocol which achieves active security while using only a constant number of garbled circuits per evaluation in the amortized setting.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- garbling schemestwo-party computation
- Contact author(s)
- jbn @ cs au dk
- History
- 2017-01-20: revised
- 2016-05-22: received
- See all versions
- Short URL
- https://ia.cr/2016/495
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/495,
author = {Jesper Buus Nielsen and Claudio Orlandi},
title = {Cross&Clean: Amortized Garbled Circuits with Constant Overhead},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/495},
year = {2016},
url = {https://eprint.iacr.org/2016/495}
}
