Compact Inner Product Encryption from LWE

DOI10.1007/978-3-319-89500-0_12zbMath1452.94090OpenAlexW2797326007MaRDI QIDQ3297487

Zhedong Wang, Mingsheng Wang, Xiong Fan

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_12

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Generating shorter bases for hard random lattices
• Advances in cryptology -- EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 -- June 3, 2010. Proceedings
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Faster Bootstrapping with Polynomial Error
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Identity-Based Cryptosystems and Signature Schemes
• Functional Encryption: Definitions and Challenges
• Functional Encryption for Inner Product Predicates from Learning with Errors
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Conjunctive, Subset, and Range Queries on Encrypted Data
• Improved (Hierarchical) Inner-Product Encryption from Lattices
• Fully homomorphic encryption using ideal lattices
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Attribute-based encryption for circuits
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Compact Inner Product Encryption from LWE