Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
From MaRDI portal
Publication:1753849
DOI10.1007/978-3-319-76581-5_9zbMath1420.94057OpenAlexW2789365089MaRDI QIDQ1753849
Junichi Tomida, Pratish Datta, Tatsuaki Okamoto
Publication date: 29 May 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-76581-5_9
Related Items (19)
A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency ⋮ Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Multi-input quadratic functional encryption from pairings ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities ⋮ Multi-input attribute based encryption and predicate encryption ⋮ A survey on 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 ⋮ Multi-party functional encryption ⋮ Verifiable functional encryption using Intel SGX ⋮ Decentralized multi-client functional encryption for inner product ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ Unbounded inner product functional encryption from bilinear maps ⋮ A multi-authority approach to various predicate encryption types
This page was built for publication: Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
