Strongly full-hiding inner product encryption
From MaRDI portal
Publication:511916
DOI10.1016/J.TCS.2016.12.024zbMath1367.94307OpenAlexW2570612086WikidataQ122876635 ScholiaQ122876635MaRDI QIDQ511916
Sourav Mukhopadhyay, Ratna Dutta, Pratish Datta
Publication date: 22 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.024
Related Items (2)
Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting ⋮ A survey on functional encryption
Cites Work
- Unnamed Item
- Mergeable functional encryption
- On the power of rewinding simulators in functional encryption
- Functional Encryption for Turing Machines
- Function-Hiding Inner Product Encryption
- Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- How to Run Turing Machines on Encrypted Data
- Function-Private Subspace-Membership Encryption and Its Applications
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Simple Functional Encryption Schemes for Inner Products
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Predicate Privacy in Encryption Systems
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Candidate Multilinear Maps from Ideal Lattices
- Fully homomorphic encryption using ideal lattices
- Function-Private Functional Encryption in the Private-Key Setting
- Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
- Public-Coin Differing-Inputs Obfuscation and Its Applications
- Fuzzy Identity-Based Encryption
- Multi-input Functional Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Reusable garbled circuits and succinct functional encryption
- On Extractability Obfuscation
This page was built for publication: Strongly full-hiding inner product encryption