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.
In 2015, Goyal et al. REF proposed for the first time the definition and construction of function encryption for random functions, which proved that the construction scheme was simulation-based security.
Functional Encryption for Randomized Functionalities
TCC
Computer Science