Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality

Autor: Azam Soleimanian, Manuel Barbosa, Bogdan Warinschi, Dario Catalano
Přispěvatelé: Universidade do Porto, Dipartimento di Matematica e Informatica (DMI), Università degli studi di Catania [Catania], Laboratoire d'informatique de l'école normale supérieure (LIENS), Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Université Paris sciences et lettres (PSL), École normale supérieure - Paris (ENS Paris), Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Kharazmi University [Tehran], This work was supported in part by Royal Society grant for international collaboration and by the European Union Horizon 2020 Research and Innovation Programme under grant agreement 780108 (FENTEC). The first author is financed by Project NanoSTIMA (NORTE-01-0145-FEDER-000016) through the North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement and the ERDF., Mitsuru Matsui, European Project: 780108,H2020,FENTEC(2018), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Département d'informatique de l'École normale supérieure (DI-ENS), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Universidade do Porto = University of Porto, Università degli studi di Catania = University of Catania (Unict), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris
Rok vydání: 2019
Předmět:
Zdroj: Topics in Cryptology – CT-RSA 2019-The Cryptographers Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings
Topics in Cryptology – CT-RSA 2019-The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings
Topics in Cryptology – CT-RSA 2019
Topics in Cryptology – CT-RSA 2019, Mar 2019, San Francisco, United States. pp.127-148, ⟨10.1007/978-3-030-12612-4_7⟩
Topics in Cryptology – CT-RSA 2019 ISBN: 9783030126117
CT-RSA
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Topics in Cryptology – CT-RSA 2019
ISSN: 0302-9743
1611-3349
DOI: 10.1007/978-3-030-12612-4_7
Popis: We construct functional encryption (FE) schemes for the orthogonality (OFE) relation where each ciphertext encrypts some vector x and each decryption key, associated to some vector y, allows to determineif x isorthogonalto y ornot. Motivated by compelling applications, we aim at schemes which are function hidding, i.e. y is not leaked. Our main contribution are two such schemes, both rooted in existing constructions of FE for inner products (IPFE), i.e., where decryption keys reveal the inner product of x and y. The first construction builds upon the very efficient IPFE by Kim et al. (SCN 2018) but just like the original scheme its security holds in the generic group model (GGM). The second scheme builds on recent developments in the construction of efficient IPFE schemes in the standard model and extends the work of Wee (TCC 2017) in leveraging these results for the construction of FE for Boolean functions. Conceptually, both our constructions can be seen as further evidence that shutting down leakage from inner product values to only a single bit for the orthogonality relation can be done with little overhead, not only in the GGM, but also in the standard model. We discuss potential applications of our constructions to secure data bases and provide efficiency benchmarks. Our implementation shows that the first scheme is extremely fast and ready to be deployed in practical applications.
Databáze: OpenAIRE
Externí odkaz: