Paper 2016/425
Multi-Input Inner-Product Functional Encryption from Pairings
Michel Abdalla, Romain Gay, 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.
Metadata
- Available format(s)
- Publication info
- A major revision of an IACR publication in EUROCRYPT 2017
- DOI
- 10.1007/978-3-319-56620-7_21
- Keywords
- Functional Encryptionmulti-inputinner-product
- Contact author(s)
- rgay @ di ens fr
- History
- 2017-06-01: last of 3 revisions
- 2016-05-01: received
- See all versions
- Short URL
- https://ia.cr/2016/425
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/425, author = {Michel Abdalla and Romain Gay and Mariana Raykova and Hoeteck Wee}, title = {Multi-Input Inner-Product Functional Encryption from Pairings}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/425}, year = {2016}, doi = {10.1007/978-3-319-56620-7_21}, url = {https://eprint.iacr.org/2016/425} }