Abstract
In this work, we present the first definitions and constructions for functional encryption supporting randomized functionalities.The setting of randomized functionalities require us to revisit functional encryption definitions by, for the first time, explicitly adding security requirements for dishonest encryptors, to ensure that they cannot improperly tamper with the randomness that will be used for computing outputs. Our constructions are built using indistinguishability obfuscation.
Cite
CITATION STYLE
Goyal, V., Jain, A., Koppula, V., & Sahai, A. (2015). Functional encryption for randomized functionalities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9015, pp. 325–351). Springer Verlag. https://doi.org/10.1007/978-3-662-46497-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
