### Ad Hoc Multi-Input Functional Encryption

Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O’Neill, and Justin Thaler

##### Abstract

Consider sources that supply sensitive data to an aggregator. Standard encryption only hides the data from eavesdroppers, but using specialized encryption one can hope to hide the data (to the extent possible) from the aggregator itself. For flexibility and security, we envision schemes that allow sources to supply encrypted data, such that at any point a dynamically chosen subset of sources can allow an agreed-upon joint function of their data to be computed by the aggregator. A primitive called multi-input functional encryption (MIFE), due to Goldwasser et al. (EUROCRYPT 2014), comes close, but has two main limitations: – it requires trust in a third party, who is able to decrypt all the data, and – it requires function arity to be fixed at setup time and to be equal to the number of parties. To drop these limitations, we introduce a new notion of ad hoc MIFE. In our setting, each source generates its own public key and issues individual, function-specific secret keys to an aggregator. For successful decryption, an aggregator must obtain a separate key from each source whose ciphertext is being computed upon. The aggregator could obtain multiple such secret keys from a user corresponding to functions of varying arity. For this primitive, we obtain the following results: – We show that standard MIFE for general functions can be bootstrapped to ad hoc MIFE for free, i.e. without making any additional assumption. – We provide a direct construction of ad hoc MIFE for the inner product functionality based on the Learning with Errors (LWE) assumption. This yields the first construction of this natural primitive based on a standard assumption. At a technical level, our results are obtained by combining standard MIFE schemes and two-round secure multiparty computation (MPC) protocols in novel ways highlighting an interesting interplay between MIFE and two-round MPC in the construction of non interactive primitives.

Available format(s)
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
multi input functional encryption
Contact author(s)
shweta a @ gmail com
clrmic2 @ gmail com
amoneill @ gmail com
History
Short URL
https://ia.cr/2019/356

CC BY

BibTeX

@misc{cryptoeprint:2019/356,
author = {Shweta Agrawal and Michael Clear and Ophir Frieder and Sanjam Garg and Adam O’Neill and Justin Thaler},
title = {Ad Hoc Multi-Input Functional Encryption},
howpublished = {Cryptology ePrint Archive, Paper 2019/356},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/356}},
url = {https://eprint.iacr.org/2019/356}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.