Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

Functional encryption is a modern public-key paradigm where a master secret key can be used to derive sub-keys $$SK_F$$ associated with certain functions F in such a way that the decryption operation reveals FM, if M is the encrypted message, and nothing else. Recently, Abdalla et al. gave simple and efficient realizations of the primitive for the computation of linear functions on encrypted data: given an encryption of a vector $$\varvec{y}$$ over some specified base ring, a secret key $$SK_{\varvec{x}}$$ for the vector $$\varvec{x}$$ allows computing $$\langle \varvec{x},\varvec{y} \rangle $$. Their technique surprisingly allows for instantiations under standard assumptions, like the hardness of the Decision Diffie-Hellman $$\mathsf {DDH}$$ and Learning-with-Errors $$\mathsf {LWE}$$ problems. Their constructions, however, are only proved secure against selective adversaries, which have to declare the challenge messages $$M_0$$ and $$M_1$$ at the outset of the game. In this paper, we provide constructions that provably achieve security against more realistic adaptive attacks where the messages $$M_0$$ and $$M_1$$ may be chosen in the challenge phase, based on the previously collected information for the same inner product functionality. Our constructions are obtained from hash proof systems endowed with homomorphic properties over the key space. They are almost as efficient as those of Abdalla et al. and rely on the same hardness assumptions. In addition, we obtain a solution based on Paillier's composite residuosity assumption, which was an open problem even in the case of selective adversaries. We also propose $$\mathsf {LWE}$$-based schemes that allow evaluation of inner products modulo a primei¾?p, as opposed to the schemes of Abdalla et al. that are restricted to evaluations of integer inner products of short integer vectors. We finally propose a solution based on Paillier's composite residuosity assumption that enables evaluation of inner products modulo an RSA integeri¾?$$N = p \cdot q$$. We demonstrate that the functionality of inner products over a prime field is powerful and can be used to construct bounded collusion FE for all circuits.