Cryptology ePrint Archive: Report 2020/1224

Multi-Input Functional Encryption: Efficient Applications From Symmetric Primitives (extended version)

Alexandros Bakas and Antonis Michalas

Abstract: Functional Encryption (FE) allows users who hold a specific secret key (known as the functional key) to learn a specific function of encrypted data whilst learning nothing about the content of the underlying data. Considering this functionality and the fact that the field of FE is still in its infancy, we sought a route to apply this potent tool to design efficient applications. To this end, we first built a symmetric FE scheme for the $\ell_1$ norm of a vector space, which allows us to compute the sum of the components of an encrypted vector. Then, we utilized our construction, to design an Order-Revealing Encryption (ORE) scheme and a privately encrypted database. While there is room for improvement in our schemes, this work is among the first attempts that seek to utilize FE for the solution of practical problems that can have a tangible effect on people's daily lives.

Category / Keywords: secret-key cryptography / Differential Privacy, Functional Encryption, Order Revealing Encryption

Original Publication (with minor differences): TrustCom 2020

Date: received 5 Oct 2020

Contact author: antonios michalas at tuni fi

Available format(s): PDF | BibTeX Citation

Version: 20201006:095216 (All versions of this report)

Short URL: ia.cr/2020/1224


[ Cryptology ePrint archive ]