Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings

DOI10.1007/978-3-319-96884-1_20zbMath1444.94036OpenAlexW2794753592MaRDI QIDQ1673411

Dario Catalano, Michel Abdalla, Bogdan Ursu, Dario Fiore, Romain Gay

Publication date: 12 September 2018

Full work available at URL: https://zenodo.org/record/3406014

zbMATH Keywords

new constructions of multi-input functional encryption (MIFE) schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (33)

Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Multi-input quadratic functional encryption from pairings ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Multi-client inner product encryption: function-hiding instantiations without random oracles ⋮ DFE-IP: delegatable functional encryption for inner product ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric ⋮ (Inner-product) functional encryption with updatable ciphertexts ⋮ Multi-input attribute based encryption and predicate encryption ⋮ A survey on functional encryption ⋮ Efficient lattice-based inner-product functional encryption ⋮ Attribute-based multi-input FE (and more) for attribute-weighted sums ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE ⋮ Inner-product functional encryption with fine-grained access control ⋮ Decentralized multi-client functional encryption for set intersection with improved efficiency ⋮ Decentralized multi-client functional encryption for inner product ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ An Anonymous Trace-and-Revoke Broadcast Encryption Scheme ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors ⋮ Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions ⋮ Improved unbounded inner-product functional encryption ⋮ Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH} ⋮ Simple and efficient FE for quadratic functions ⋮ Lower bounds for lattice-based compact functional encryption ⋮ Impossibility results for lattice-based functional encryption schemes ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ Non-interactive anonymous router ⋮ Multi-client functional encryption for separable functions ⋮ Dynamic decentralized functional encryption

This page was built for publication: Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings