Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks [chapter]

Shweta Agrawal
2017 Lecture Notes in Computer Science  
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
more » ... lies: * IIT Madras, India. Email: 1 We note that due to a lower bound [AGVW13], the ciphertext size must necessarily grow with Q.
doi:10.1007/978-3-319-63688-7_1 fatcat:fqlsymnqybcu3bc6acwdlx2lku