How to leverage hardness of constant-degree expanding polynomials over ℝ to build iO
In this work, we introduce and construct D-restricted Functional Encryption (FE) for any constant D ≥ 3, based only on the SXDH assumption over bilinear groups. This generalizes the notion of 3-restricted FE recently introduced and constructed by Ananth et al. (ePrint 2018) in the generic bilinear group model. A D = (d+ 2)-restricted FE scheme is a secret key FE scheme that allows an encryptor to efficiently encrypt a message of the form M = (x,y,z). Here, x ∈ Fd×n p and y,z ∈ Fp. Function keys can be issued for a function f = ΣI=(i1,..,id,j,k) cI ·x[1, i1] · · ·x[d, id] · y[j] · z[k] where the coefficients cI ∈ Fp. Knowing the function key and the ciphertext, one can learn f(x,y,z), if this value is bounded in absolute value by some polynomial in the security parameter and n. The security requirement is that the ciphertext hides y and z, although it is not required to hide x. Thus x can be seen as a public attribute. D-restricted FE allows for useful evaluation of constant-degree polynomials, while only requiring the SXDH assumption over bilinear groups. As such, it is a powerful tool for leveraging hardness that exists in constant-degree expanding families of polynomials over R. In particular, we build upon the work of Ananth et al. to show how to build indistinguishability obfuscation (iO) assuming only SXDH over bilinear groups, LWE, and assumptions relating to weak pseudorandom properties of constant-degree expanding polynomials over R.