Cross and Clean: Amortized Garbled Circuits with Constant Overhead

Conference paper

DOI: 10.1007/978-3-662-53641-4_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9985)
Cite this paper as:
Nielsen J.B., Orlandi C. (2016) Cross and Clean: Amortized Garbled Circuits with Constant Overhead. In: Hirt M., Smith A. (eds) Theory of Cryptography. TCC 2016. Lecture Notes in Computer Science, vol 9985. Springer, Berlin, Heidelberg

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 cut-and-choose approach, and the main measure of efficiency in cut-and-choose based protocols is the number of garbled circuits which need to be constructed, exchanged and evaluated.

In this paper we investigate the following, natural question: how many garbled circuits are needed to achieve active security? and we show that in the amortized setting (for large enough circuits and number of executions), it is possible to achieve active security while using only a constant number of garbled circuits.

Copyright information

© International Association for Cryptologic Research 2016

Authors and Affiliations

  1. 1.Aarhus UniversityAarhusDenmark

Personalised recommendations