A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
We construct a functional encryption scheme for circuits which simultaneously achieves and improves upon the security of the current best known, and incomparable, constructions from standard assumptions: reusable garbled circuits by Goldwasser, Kalai, Popa, Vaikuntanathan and Zeldovich (STOC 2013) [GKP + 13] and predicate encryption for circuits by Gorbunov, Vaikuntanathan and Wee (CRYPTO 2015) [GVW15]. Our scheme is secure based on the learning with errors (LWE) assumption. Our construction
doi:10.1007/978-3-319-63688-7_1
fatcat:fqlsymnqybcu3bc6acwdlx2lku