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 (Contributor), Kalai, Yael Tauman (Author), Popa, Raluca Ada (Contributor), Vaikuntanathan, Vinod (Author), Zeldovich, Nickolai (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery,
2014-10-30T19:59:50Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
How to Run Turing Machines on Encrypted Data
by: Goldwasser, Shafi, et al.
Published: (2014) -
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) -
Black-box circular-secure encryption beyond affine functions
by: Brakerski, Zvika, et al.
Published: (2012) -
Robustness of the Learning with Errors Assumption
by: Goldwasser, Shafi, et al.
Published: (2012)