CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes

DOI10.1515/jmc-2019-0026zbMath1462.94030OpenAlexW3079221395WikidataQ121676915 ScholiaQ121676915MaRDI QIDQ2023314

Dimitar Jetchev, Christina Boura, Nicolas Gama, Mariya Georgieva

Publication date: 3 May 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2019-0026

zbMATH Keywords

floating point computationfully homomorphic encryptionring-LWElattice based cryptographyB/FVHEAANTFHE

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

CHIMERA ⋮ Discretization error reduction for high precision torus fully homomorphic encryption ⋮ BLEACH: cleaning errors in discrete computations over CKKS ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE ⋮ \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain ⋮ HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering ⋮ Private AI: Machine Learning on Encrypted Data ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts

Uses Software

• NTRU
• FHEW
• SEAL
• TFHE

Cites Work

• Unnamed Item
• On the concrete hardness of learning with errors
• Homomorphic lower digits removal and improved FHE bootstrapping
• Bootstrapping for approximate homomorphic encryption
• High-precision arithmetic in homomorphic encryption
• Homomorphic encryption for arithmetic of approximate numbers
• Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms
• FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
• On Ideal Lattices and Learning with Errors over Rings
• Fully homomorphic encryption using ideal lattices
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials