Controlled Functional Encryption Revisited: Multi-Authority Extensions and Efficient Schemes for Quadratic Functions

• Published in: Proceedings on Privacy Enhancing Technologies 2021-01, Vol.2021 (1), p.21-42
• Main Authors: Ambrona, Miguel, Fiore, Dario, Soriente, Claudio
• Format: Article
• Language: English
• Subjects: computation over encrypted data; controlled function encryption
• ISSN: 2299-0984; 2299-0984
• DOI: 10.2478/popets-2021-0003

In a Functional Encryption scheme (FE), a trusted authority enables designated parties to compute specific functions over encrypted data. As such, FE promises to break the tension between industrial interest in the potential of data mining and user concerns around the use of private data. FE allows the authority to decide can compute and can be computed, but it does not allow the authority to control ciphertexts can be mined. This issue was recently addressed by Naveed et al., that introduced so-called Functional encryption (or C-FE), a cryptographic framework that extends FE and allows the authority to exert fine-grained control on the ciphertexts being mined. In this work we extend C-FE in several directions. First, we distribute the role of (and the trust in) the authority across several parties by defining multi-authority C-FE (or mCFE). Next, we provide an efficient instantiation that enables computation of quadratic functions on inputs provided by multiple data-owners, whereas previous work only provides an instantiation for linear functions over data supplied by a single data-owner and resorts to garbled circuits for more complex functions. Our scheme leverages CCA2 encryption and linearly-homomorphic encryption. We also implement a prototype and use it to showcase the potential of our instantiation.