Paper 2018/791
Practical Fully Secure Unrestricted Inner Product Functional Encryption modulo
Guilhem Castagnos, Fabien Laguillaumie, and Ida Tucker
Abstract
Functional encryption is a modern public-key cryptographic primitive allowing an encryptor to finely control the information revealed to recipients from a given ciphertext.
Abdalla, Bourse, De Caro, and Pointcheval (PKC 2015) were the first to consider functional encryption restricted to the class of linear functions, i.e. inner products.
Though their schemes are only secure in the selective model, Agrawal, Libert, and Stehlé (CRYPTO 16) soon provided adaptively secure schemes for the same functionality. These constructions, which rely on standard assumptions such as the Decision Diffie-Hellman (DDH), the Learning-with-Errors (LWE), and Paillier's Decision Composite Residuosity (DCR) problems, do however suffer of various practical drawbacks. Namely, the DCR based scheme only computes inner products modulo an RSA integer which is oversized for many practical applications, while the computation of inner products modulo a prime
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in ASIACRYPT 2018
- Keywords
- Inner Product Functional EncryptionAdaptive SecurityDiffie-Hellman Assumptions.
- Contact author(s)
- ida tucker @ ens-lyon fr
- History
- 2018-09-01: received
- Short URL
- https://ia.cr/2018/791
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/791, author = {Guilhem Castagnos and Fabien Laguillaumie and Ida Tucker}, title = {Practical Fully Secure Unrestricted Inner Product Functional Encryption modulo $p$}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/791}, year = {2018}, url = {https://eprint.iacr.org/2018/791} }