Cryptology ePrint Archive: Report 2016/425

Multi-Input Inner-Product Functional Encryption from Pairings

Michel Abdalla and Romain Gay and Mariana Raykova and Hoeteck Wee

Abstract: We present a multi-input functional encryption scheme (MIFE) for the inner product functionality based on the k-Lin assumption in prime-order bilinear groups. Our construction works for any polynomial number of encryption slots and achieves adaptive security against unbounded collusion, while relying on standard polynomial hardness assumptions. Prior to this work, we did not even have a candidate for 3-slot MIFE for inner products in the generic bilinear group model. Our work is also the first MIFE scheme for a non-trivial functionality based on standard cryptographic assumptions, as well as the first to achieve polynomial security loss for a super-constant number of slots under falsifiable assumptions. Prior works required stronger non-standard assumptions such as indistinguishability obfuscation or multi-linear maps.

Category / Keywords: Functional Encryption, multi-input, inner-product

Original Publication (with major differences): IACR-EUROCRYPT-2017
DOI: 10.1007/978-3-319-56620-7_21

Date: received 29 Apr 2016, last revised 1 Jun 2017

Contact author: rgay at di ens fr

Available format(s): PDF | BibTeX Citation

Version: 20170601:112845 (All versions of this report)

Short URL: ia.cr/2016/425