Show simple item record

dc.contributor.authorGoldwasser, Shafi
dc.contributor.authorKalai, Yael Tauman
dc.contributor.authorPopa, Raluca Ada
dc.contributor.authorVaikuntanathan, Vinod
dc.contributor.authorZeldovich, Nickolai
dc.date.accessioned2014-10-30T19:59:50Z
dc.date.available2014-10-30T19:59:50Z
dc.date.issued2013-06
dc.identifier.isbn9781450320290
dc.identifier.issn0737-8017
dc.identifier.urihttp://hdl.handle.net/1721.1/91245
dc.description.abstractGarbled 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.en_US
dc.description.sponsorshipNatural Sciences and Engineering Research Council of Canada (NSERC Discovery Grant)en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency (DARPA award FA8750-11-2-0225)en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency (DARPA award N66001-10-2-4089)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (NSF award CNS-1053143)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (NSF award IIS-1065219)en_US
dc.description.sponsorshipGoogle (Firm)en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/2488608.2488678en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleReusable garbled circuits and succinct functional encryptionen_US
dc.typeArticleen_US
dc.identifier.citationGoldwasser, 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.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorGoldwasser, Shafien_US
dc.contributor.mitauthorPopa, Raluca Adaen_US
dc.contributor.mitauthorZeldovich, Nickolaien_US
dc.relation.journalProceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsGoldwasser, Shafi; Kalai, Yael; Popa, Raluca Ada; Vaikuntanathan, Vinod; Zeldovich, Nickolaien_US
dc.identifier.orcidhttps://orcid.org/0000-0003-4728-1535
dc.identifier.orcidhttps://orcid.org/0000-0003-0238-2703
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record