Visible to the public Garbling Gadgets for Boolean and Arithmetic Circuits

TitleGarbling Gadgets for Boolean and Arithmetic Circuits
Publication TypeConference Paper
Year of Publication2016
AuthorsBall, Marshall, Malkin, Tal, Rosulek, Mike
Conference NameProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-4139-4
Keywordscircuits, cryptography, exponentiation, garbled circuits, pubcrawl, Resiliency, secure multi-party computation, symmetric key

We present simple, practical, and powerful new techniques for garbled circuits. These techniques result in significant concrete and asymptotic improvements over the state of the art, for several natural kinds of computations. For arithmetic circuits over the integers, our construction results in garbled circuits with free addition, weighted threshold gates with cost independent of fan-in, and exponentiation by a fixed exponent with cost independent of the exponent. For boolean circuits, our construction gives an exponential improvement over the state of the art for threshold gates (including AND/OR gates) of high fan-in. Our construction can be efficiently instantiated with practical symmetric-key primitives (e.g., AES), and is proven secure under similar assumptions to that of the Free-XOR garbling scheme (Kolesnikov & Schneider, ICALP 2008). We give an extensive comparison between our scheme and state-of-the-art garbling schemes applied to boolean circuits.

Citation Keyball_garbling_2016