Reusable garbled circuits and succinct functional encryption
Name
Zeldovich_Reusable garbled.pdf
Size
302.61 KB
Format
Adobe PDF
Checksum (MD5)
8f7c69c846a49e5299c57b399a22e817
Author(s)
Goldwasser, Shafi
Kalai, Yael Tauman
Popa, Raluca Ada
Vaikuntanathan, Vinod
Zeldovich, Nickolai
Date Issued
June 2013
Journal
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13
Publisher
Association for Computing Machinery
Citation
Goldwasser, Shafi, Yael Kalai, Raluca Ada Popa, Vinod Vaikuntanathan, and Nickolai Zeldovich. “Reusable Garbled Circuits and Succinct Functional Encryption.” Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing - STOC ’13 (2013), June 1-4, 2013, Palo Alto, Calif. USA. ACM, p. 555-564.
Version
Author's final manuscript
Abstract
Garbled circuits, introduced by Yao in the mid 80s, allow computing a function f on an input x without leaking anything about f or x besides f(x). Garbled circuits found numerous applications, but every known construction suffers from one limitation: it offers no security if used on multiple inputs x. In this paper, we construct for the first time reusable garbled circuits. The key building block is a new succinct single-key functional encryption scheme.
Functional encryption is an ambitious primitive: given an encryption Enc(x) of a value x, and a secret key sk_f for a function f, anyone can compute f(x) without learning any other information about x. We construct, for the first time, a succinct functional encryption scheme for {\em any} polynomial-time function f where succinctness means that the ciphertext size does not grow with the size of the circuit for f, but only with its depth. The security of our construction is based on the intractability of the Learning with Errors (LWE) problem and holds as long as an adversary has access to a single key sk_f (or even an a priori bounded number of keys for different functions).
Building on our succinct single-key functional encryption scheme, we show several new applications in addition to reusable garbled circuits, such as a paradigm for general function obfuscation which we call token-based obfuscation, homomorphic encryption for a class of Turing machines where the evaluation runs in input-specific time rather than worst-case time, and a scheme for delegating computation which is publicly verifiable and maintains the privacy of the computation.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2488608.2488678
