When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead

DOI10.1007/978-3-030-92641-0_13zbMath1492.94078OpenAlexW4205294570MaRDI QIDQ2149801

Ilia Iliashenko, Kim Laine, Hao Chen

Publication date: 29 June 2022

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/665579

zbMATH Keywords

somewhat homomorphic encryptionencoding algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Transciphering framework for approximate homomorphic encryption

Uses Software

• SageMath

Cites Work

• Unnamed Item
• On the concrete hardness of learning with errors
• Fixed-point arithmetic in SHE schemes
• Efficiently processing complex-valued data in homomorphic encryption
• High-precision arithmetic in homomorphic encryption
• Homomorphic encryption for arithmetic of approximate numbers
• Fully homomorphic SIMD operations
• Multiparty Computation from Somewhat Homomorphic Encryption
• On Ideal Lattices and Learning with Errors over Rings
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
• Fully homomorphic encryption using ideal lattices
• Faster Homomorphic Evaluation of Discrete Fourier Transforms

This page was built for publication: When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead