Inner-Product Functional Encryption with Fine-Grained Access Control

Abstract

We construct new functional encryption schemes that combine the access control functionality of attributebased encryption with the possibility of performing linear operations on the encrypted data. While such a primitive could be easily realized from fully fledged functional encryption schemes, what makes our result interesting is the fact that our schemes simultaneously achieve all the following properties. They are public-key, efficient and can be proved secure under standard and well established assumptions (such as LWE or pairings). Furthermore, security is guaranteed in the setting where adversaries are allowed to get functional keys that decrypt the challenge ciphertext. Our first results are two functional encryption schemes for the family of functions that allow users to embed policies (expressed by monotone span programs) in the encrypted data, so that one can generate functional keys to compute weighted sums on the latter. Both schemes are pairing-based and quite generic: they combine the ALS functional encryption scheme for inner products from Crypto 2016 with any attribute-based encryption schemes relying on the dual-system encryption methodology. As an additional bonus, they yield simple and elegant multi-input extensions essentially for free, thereby broadening the set of applications for such schemes. Multi-input is a particularly desirable feature in our setting, since it gives a finer access control over the encrypted data, by allowing users to associate different access policies to different parts of the encrypted data. Our second result builds identity-based functional encryption for inner products from lattices. This is achieved by carefully combining existing IBE schemes from lattices with adapted, LWE-based, variants of ALS. We point out to intrinsic technical bottlenecks to obtain richer forms of access control from lattices. From a conceptual point of view, all our results can be seen as further evidence that more expressive forms of functional encryption can be realized under standard assumptions and with little computational overhead.

Dual Fine-Grained Public-Key Searchable Encryption from Lattices

“…In this section, we consider the security of our proposed scheme. The proof idea of IND-sAF-CKA is inspired by inner product functional encryption (IPFE) schemes (Agrawal et al, 2016, Abdalla, Catalano, Gay, & Ursu, 2020, Pal & Dutta, 2021), but we makes some modifications and improvements to them, which is suitable for our security requirements.…”

Revisiting Secure Computation Using Functional Encryption: Opportunities and Research Directions

“…Accompanying with the practical FE construction for restricted functionalities, most recent works tries to add more features to existing FE schemes such as labeled FE [Chotard et al, 2018], decentralized FE [Abdalla et al, 2019], dynamic decentralized FE [Chotard et al, 2020], and FE with access control [Abdalla et al, 2020]. The labeled FE tries to fill the gap between the multi-input and multi-client scenarios.…”

A Review of Functional Encryption in IoT Applications

“…In such a situation, a function can be generated for the expert to only look at the transmission-control protocol (TCP) port, giving the external expert the corresponding key, and restricting their access only to the desired information. Since its introduction, functional encryption has attracted a lot of interest, and its known results are broadly categorized as either focusing on feasibility results for general functionalities, or concrete, efficient realizations for restricted functionalities of practical interest [ 5 ]. In this work, we review the recent applications of functional encryption and the major cryptographic primitives that it covers.…”