A full RNS variant of FV like somewhat homomorphic encryption schemes

DOI10.1007/978-3-319-69453-5_23zbMath1418.94029OpenAlexW2527617455MaRDI QIDQ1698661

Vincent Zucca, Julien Eynard, Jean-Claude Bajard, M. Anwarul Hasan

Publication date: 16 February 2018

Full work available at URL: https://hal.sorbonne-universite.fr/hal-01371941/file/SAC2016.pdf

zbMATH Keywords

lattice-based cryptographyhomomorphic encryptionsoftware implementationFan and Vercauteren (FV) schemeresidue number systems (RNS)

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (14)

Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM ⋮ Faster homomorphic encryption over GPGPUs via hierarchical DGT ⋮ Approximate homomorphic encryption with reduced approximation error ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Revisiting homomorphic encryption schemes for finite fields ⋮ A full RNS variant of FV like somewhat homomorphic encryption schemes ⋮ Accelerating HE operations from key decomposition technique ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ A full RNS variant of approximate homomorphic encryption ⋮ Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts

Cites Work

• Unnamed Item
• Modular hardware architecture for somewhat homomorphic function evaluation
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• NFLlib: NTT-Based Fast Lattice Library
• (Leveled) fully homomorphic encryption without bootstrapping
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Lattice Signatures and Bimodal Gaussians
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Lattice Signatures without Trapdoors
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Efficient Identity-Based Encryption over NTRU Lattices
• Lattice Cryptography for the Internet
• Modular Multiplication Without Trial Division
• Efficient Public Key Encryption Based on Ideal Lattices
• Fast base extension using a redundant modulus in RNS
• Candidate Multilinear Maps from Ideal Lattices
• A Comparison of the Homomorphic Encryption Schemes FV and YASHE
• Fully homomorphic encryption using ideal lattices
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices

This page was built for publication: A full RNS variant of FV like somewhat homomorphic encryption schemes