Multi-input Functional Encryption
- Shafi Goldwasser ,
- S. Dov Gordon ,
- Vipul Goyal ,
- Abhishek Jain ,
- Jonathan Katz ,
- Feng-Hao Liu ,
- Amit Sahai ,
- Elaine Shi ,
- Hong-Sheng Zhou
33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques |
Published by Springer Berlin Heidelberg
We introduce the problem of Multi-Input Functional Encryption, where a secret key sk f can correspond to an n-ary function f that takes multiple ciphertexts as input. We formulate both indistinguishability-based and simulation-based definitions of security for this notion, and show close connections with indistinguishability and virtual black-box definitions of obfuscation.
Assuming indistinguishability obfuscation for circuits, we present constructions achieving indistinguishability security for a large class of settings. We show how to modify this construction to achieve simulation-based security as well, in those settings where simulation security is possible