Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-48797-6_2 | IACR Cryptology ePrint Archive |
Field | DocType | Volume |
Discrete mathematics,Secure multi-party computation,Arity,Computer science,Algorithm,Theoretical computer science,Functional encryption,Turing machine,Hash function,Obfuscation,Bounded function,Computation | Journal | 2015 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saikrishna Badrinarayanan | 1 | 63 | 11.17 |
| Divya Gupta 0001 | 2 | 95 | 7.44 |
| Abhishek Jain | 3 | 879 | 48.25 |
| Amit Sahai | 4 | 13566 | 545.52 |