Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding

DOI10.1007/978-3-319-99807-7_7MaRDI QIDQ6163655zbMATH OpenOpenAlexFDO

Authors Fucai Luo, Kun Peng Wang, Changlu Lin

Publication date 30 June 2023

Published in Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99807-7_7

zbMATH Keywords

FHEhierarchical identity-based encryptionlearning with rounding

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Multi-identity and multi-key leveled FHE from learning with errors
• Bootstrappable identity-based fully homomorphic encryption
• (Leveled) fully homomorphic encryption without bootstrapping
• (Leveled) fully homomorphic encryption without bootstrapping
• An efficient multi-identity-based fully homomorphic encryption scheme

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Analyzing the shuffling side-channel countermeasure for lattice-based signatures
• Bonsai trees, or how to delegate a lattice basis
• Bootstrappable identity-based fully homomorphic encryption
• Bootstrapping for HElib
• Classical hardness of learning with errors
• Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Efficient lattice (H)IBE in the standard model
• Faster Bootstrapping with Polynomial Error
• Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Hierarchical ID-Based Cryptography
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic encryption with access policies: characterization and new constructions
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Identity-based cryptosystems and signature schemes
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Learning with rounding, revisited. New reduction, properties and applications
• On lattices, learning with errors, random linear codes, and cryptography
• On the hardness of learning with rounding over small modulus
• Pseudorandom functions and lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(2)

• Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings
• A new construction of keyed-FHE without zk-SNARK for homomorphic evaluation

This page was built for publication: Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163655)