A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Mergeable Functional Encryption
[chapter]
2017
Lecture Notes in Computer Science
In recent years, there has been great interest in Functional Encryption (FE), a generalization of traditional encryption where a token enables a user to learn a specific function of the encrypted data and nothing else. In this paper we put forward a new generalization of FE that we call M ergeable FE (mFE). In a mFE system, given a ciphertext c 1 encrypting m 1 and a ciphertext c 2 encrypting m 2 , it is possible to produce in an oblivious way (i.e., given only the public-key and without
doi:10.1007/978-3-319-68637-0_26
fatcat:drsf7y2eh5dxnfutsvl2dxvtdm