[Resource Topic] 2020/1285: Multi-Input Quadratic Functional Encryption from Pairings

Welcome to the resource topic for 2020/1285

Multi-Input Quadratic Functional Encryption from Pairings

Authors: Shweta Agrawal, Rishab Goyal, Junichi Tomida


We construct the first multi-input functional encryption \allowbreak(MIFE) scheme for quadratic functions from pairings. Our construction supports polynomial number of users, where user i, for i \in [n], encrypts input \bfx_i \in \mbZ^m to obtain ciphertext \ct_i, the key generator provides a key \sk_\bfc for vector \bfc \in \mbZ^{({mn})^2} and decryption, given \ct_1,\ldots,\ct_n and \sk_\bfc, recovers \ip{\bfc}{\bfx \otimes \bfx} and nothing else. We achieve indistinguishability-based (selective) security against unbounded collusions under the standard bilateral matrix Diffie-Hellman assumption. All previous MIFE schemes either support only inner products (linear functions) or rely on strong cryptographic assumptions such as indistinguishability obfuscation or multi-linear maps.

ePrint: https://eprint.iacr.org/2020/1285

Talk: https://www.youtube.com/watch?v=eRI-y_8cv64

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .