Reusable garbled circuits and succinct functional encryption
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...
Main Authors: | Goldwasser, Shafi, Kalai, Yael Tauman, Popa, Raluca Ada, Vaikuntanathan, Vinod, Zeldovich, Nickolai |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery
2014
|
Online Access: | http://hdl.handle.net/1721.1/91245 https://orcid.org/0000-0003-4728-1535 https://orcid.org/0000-0003-0238-2703 |
Similar Items
-
How to Run Turing Machines on Encrypted Data
by: Goldwasser, Shafi, et al.
Published: (2014) -
Black-box circular-secure encryption beyond affine functions
by: Brakerski, Zvika, et al.
Published: (2012) -
Succinct garbled RAM from indistinguishablity obfuscation
by: Holmgren, Justin Lee
Published: (2016) -
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
by: Boneh, Dan, et al.
Published: (2014) -
CryptDB: A Practical Encrypted Relational DBMS
by: Popa, Raluca Ada, et al.
Published: (2011)