Multi-input Functional Encryption
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 securit
- PDF / 401,977 Bytes
- 25 Pages / 439.363 x 666.131 pts Page_size
- 88 Downloads / 204 Views
nd Weizmann, Israel [email protected] 2 Applied Communication Sciences, USA [email protected] 3 Microsoft Research, India [email protected] 4 Boston University and MIT, USA [email protected] 5 University of Maryland, USA {jkatz,fenghao,elaine}@cs.umd.edu 6 UCLA [email protected] 7 Virginia Commonwealth University, USA [email protected]
†
‡ §
This conference proceedings publication is the result of a merge of two independent and concurrent works. The two papers were authored by Goldwasser, Goyal, Jain, and Sahai; and by Gordon, Katz, Liu, Shi, and Zhou. Research supported by NSFEAGER award # CNS1347364 DARPA award # FA8750-11-2-0225 and the Simons Foundation - Investigation Award. Research supported by NSF awards #1111599 and #1223623, and by the US Army Research Laboratory and the UK Ministry of Defence under Agreement Number W911NF-06-3-0001. The views and conclusions contained herein are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the US Army Research Laboratory, the U.S. Government, the UK Ministry of Defense, or the UK Government. The US and UK Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon. Research supported in part from a DARPA/ONR PROCEED award, NSF grants 1228984, 1136174, 1118096, and 1065276, a Xerox Faculty Research Award, a Google Faculty Research Award, an equipment grant from Intel, and an Okawa Foundation Research Grant. This material is based upon work supported by the Defense Advanced Research Projects Agency through the U.S. Office of Naval Research under Contract N00014-11- 1-0389. The views expressed are those of the author and do not reflect the official policy or position of the Department of Defense, the National Science Foundation, or the U.S. Government. This work is partially supported by NSF award CNS-1314857 and a Google Research Award. This work is partially supported by an NSF CI postdoctoral fellowship, and was mostly done while at the University of Maryland.
P.Q. Nguyen and E. Oswald (Eds.): EUROCRYPT 2014, LNCS 8441, pp. 578–602, 2014. c International Association for Cryptologic Research 2014
Multi-input Functional Encryption
579
Abstract. 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 simulationbased security as well, in those settings where simulation security is possible.
1
Introduction
Traditionally, encryption has been used to secure a communication channel between a un
Data Loading...
