In this paper we construct CHCPRFs for all NC1 circuits from the Learning with Errors assumption. The construction draws heavily from the graph-induced multilinear maps by Gentry, Gorbunov and Halevi [TCC 2015], as well as the existing lattice-based PRFs. Our construction gives an instance of the GGH15 applications with a security reduction to LWE.
We also show how to build from CHCPRFs reusable garbled circuits (RGC), or equivalently private-key function-hiding functional encryptions with 1-key security. This provides a different approach of constructing RGC from that of Goldwasser et al. [STOC 2013].Category / Keywords: Graded encodings, constraint-hiding PRFs, functional encryption Original Publication (in the same form): IACR-EUROCRYPT-2017 Date: received 15 Feb 2017, last revised 26 Feb 2017 Contact author: canetti at tau ac il, chenyl@bu edu Available format(s): PDF | BibTeX Citation Version: 20170226:195112 (All versions of this report) Short URL: ia.cr/2017/143 Discussion forum: Show discussion | Start new discussion