Efficient functional encryption for inner-product values with full-hiding security
From MaRDI portal
Publication:1799201
DOI10.1007/978-3-319-45871-7_24zbMATH Open1397.68064OpenAlexW2513854448MaRDI QIDQ1799201FDOQ1799201
Authors: Junichi Tomida, Masayuki Abe, Tatsuaki Okamoto 
Publication date: 18 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-45871-7_24
Recommendations
Cited In (30)
- Post-quantum secure inner product functional encryption using multivariate public key cryptography
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Efficient anonymous multi-group broadcast encryption
- Functional encryption for inner product with full function privacy
- A new approach to practical function-private inner product encryption
- A survey on functional encryption
- Hierarchical identity-based inner product functional encryption
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner product functional encryption from bilinear maps
- Multi-input quadratic functional encryption from pairings
- Efficient lattice-based inner-product functional encryption
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Unbounded inner-product functional encryption with succinct keys
- Adaptive simulation security for inner product functional encryption
- Implementing, and keeping in check, a DSL used in E-learning
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Lattice-Based Secure Biometric Authentication for Hamming Distance
- A New Functional Encryption for Multidimensional Range Query (Short Paper)
- Tightly CCA-secure inner product functional encryption scheme
- CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not $$\mathtt {q}$$ -type) Assumptions
- Efficient function-hiding functional encryption: from inner-products to orthogonality
- DFE-IP: delegatable functional encryption for inner product
- Multi-client inner product encryption: function-hiding instantiations without random oracles
- Achieving IND-CCA Security for Functional Encryption for Inner Products
- Strongly full-hiding inner product encryption
- Adaptively simulation-secure attribute-hiding predicate encryption
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
- Efficient inner product encryption with simulation-based security
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
This page was built for publication: Efficient functional encryption for inner-product values with full-hiding security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799201)
