An improved RNS variant of the BFV homomorphic encryption scheme

DOI10.1007/978-3-030-12612-4_5zbMath1448.94203OpenAlexW2795187181MaRDI QIDQ2290443

Yuriy Polyakov, Shai Halevi, Victor Shoup

Publication date: 28 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-12612-4_5

zbMATH Keywords

lattice-based cryptographyhomomorphic encryptionpost-quantum cryptographysoftware implementationresidue number systems

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

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 ⋮ FASTA -- a stream cipher for fast FHE evaluation ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ Revisiting homomorphic encryption schemes for finite fields ⋮ Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ Finding and evaluating parameters for BGV ⋮ 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 ⋮ On the Hardness of Scheme-Switching Between SIMD FHE Schemes ⋮ 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

This page was built for publication: An improved RNS variant of the BFV homomorphic encryption scheme