Welcome to the resource topic for 2021/739
Title:
A New Approach to Garbled Circuits
Authors: Anasuya Acharya, Tomer Ashur, Efrat Cohen, Carmit Hazay, Avishay Yanai
Abstract:A garbling scheme is a fundamental cryptographic building block with a long list of applications. In this work we revisit the foundations of garbled circuits to propose a novel approach for garbling where the truth table of each gate is represented as a whole using a single encoding of parameterized length rather than being encrypted in a row-wise manner. We prove the scheme’s security for the case where each gate encoding has the same length \ell as the labels. This scheme improves over the state-of-the-art in both gate size compression—improving over the work of Rosulek and Roy (CRYPTO’21) which required 1.5\ell bits to represent a garbled gate—and in the adversary model, yielding statistical security for arbitrary circuits, and against adversaries that are computationally unbounded and are allowed an exponential number of random oracle queries.
ePrint: https://eprint.iacr.org/2021/739
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .