Paper 2015/1136

Multi-Input Functional Encryption for Unbounded Arity Functions

Saikrishna Badrinarayanan, Divya Gupta, Abhishek Jain, and Amit Sahai

Abstract

The notion of multi-input functional encryption (MI-FE) was recently introduced by Goldwasser et al. [EUROCRYPT’14] as a means to non-interactively compute aggregate information on the joint private data of multiple users. A fundamental limitation of their work, however, is that the total number of users (which corresponds to the arity of the functions supported by the MI-FE scheme) must be a priori bounded and fixed at the system setup time. In this work, we overcome this limitation by introducing the notion of unbounded input MI-FE that supports the computation of functions with unbounded arity. We construct such an MI-FE scheme with indistinguishability security in the selective model based on the existence of public-coin differing-inputs obfuscation for turing machines and collision-resistant hash functions. Our result enables several new exciting applications, including a new paradigm of on-the-fly secure multiparty computation where new users can join the system dynamically.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published by the IACR in ASIACRYPT 2015
Keywords
Functional EncryptionObfuscation
Contact author(s)
saikrishna @ cs ucla edu
History
2015-11-26: received
Short URL
https://ia.cr/2015/1136
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/1136,
      author = {Saikrishna Badrinarayanan and Divya Gupta and Abhishek Jain and Amit Sahai},
      title = {Multi-Input Functional Encryption for Unbounded Arity Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2015/1136},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/1136}},
      url = {https://eprint.iacr.org/2015/1136}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.