Paper 2017/972

Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings

Michel Abdalla, Dario Catalano, Dario Fiore, Romain Gay, and Bogdan Ursu

Abstract

We present new constructions of multi-input functional encryption (MIFE) schemes for the inner-product functionality that improve the state of the art solution of Abdalla et al. (Eurocrypt 2017) in two main directions. First, we put forward a novel methodology to convert single-input functional encryption for inner products into multi-input schemes for the same functionality. Our transformation is surprisingly simple, general, and efficient. In particular, it does not require pairings and it can be instantiated with all known single-input schemes. This leads to two main advances. First, we enlarge the set of assumptions this primitive can be based on, notably obtaining new MIFEs for inner products from plain DDH, LWE and Composite Residuosity. Second, we obtain the first MIFE schemes from standard assumptions where decryption works efficiently even for messages of super-polynomial size. Our second main contribution is the first function-hiding MIFE scheme for inner products based on standard assumptions. To this end, we show how to extend the original, pairing-based, MIFE by Abdalla et al. in order to make it function hiding, thus obtaining a function-hiding MIFE from the MDDH assumption.

Metadata
Available format(s)
PDF
Publication info
A major revision of an IACR publication in CRYPTO 2018
DOI
10.1007/978-3-319-96884-1_20
Keywords
Functional Encryptionmulti-inputinner-product
Contact author(s)
michel abdalla @ ens fr
History
2018-09-07: revised
2017-10-05: received
See all versions
Short URL
https://ia.cr/2017/972
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/972,
      author = {Michel Abdalla and Dario Catalano and Dario Fiore and Romain Gay and Bogdan Ursu},
      title = {Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2017/972},
      year = {2017},
      doi = {10.1007/978-3-319-96884-1_20},
      note = {\url{https://eprint.iacr.org/2017/972}},
      url = {https://eprint.iacr.org/2017/972}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.