Compact (Targeted Homomorphic) Inner Product Encryption from LWE
From MaRDI portal
Publication:3297486
DOI10.1007/978-3-319-89500-0_11zbMath1452.94075OpenAlexW2797650186MaRDI QIDQ3297486
Kun-Peng Wang, Xianhui Lu, Daode Zhang, Jie Li
Publication date: 20 July 2020
Published in: Information and Communications Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-89500-0_11
Cites Work
- Unnamed Item
- Generating shorter bases for hard random lattices
- Inner-product encryption under standard assumptions
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption
- Functional Encryption for Inner Product Predicates from Learning with Errors
- Deniable Attribute Based Encryption for Branching Programs from LWE
- Targeted Homomorphic Attribute-Based Encryption
- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Bonsai Trees, or How to Delegate a Lattice Basis
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Hierarchical Predicate Encryption for Inner-Products
- Improved (Hierarchical) Inner-Product Encryption from Lattices
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
This page was built for publication: Compact (Targeted Homomorphic) Inner Product Encryption from LWE