Multi-input Functional Encryption
- Cite this paper as:
- Goldwasser S. et al. (2014) Multi-input Functional Encryption. In: Nguyen P.Q., Oswald E. (eds) Advances in Cryptology – EUROCRYPT 2014. EUROCRYPT 2014. Lecture Notes in Computer Science, vol 8441. Springer, Berlin, Heidelberg
We introduce the problem of Multi-Input Functional Encryption, where a secret key skf 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.
Unable to display preview. Download preview PDF.