An improved RNS variant of the BFV homomorphic encryption scheme

DOI10.1007/978-3-030-12612-4_5MaRDI QIDQ2290443zbMATH OpenOpenAlexFDO

Authors Shai Halevi, Yuriy Polyakov, 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

homomorphic encryptionlattice-based cryptographypost-quantum cryptographyresidue number systemssoftware implementation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A full RNS variant of FV like somewhat homomorphic encryption schemes
• Revisiting homomorphic encryption schemes for finite fields
• A full RNS variant of approximate homomorphic encryption
• High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function
• Approximate homomorphic encryption with reduced approximation error

Cited in

(31)

• A full RNS variant of FV like somewhat homomorphic encryption schemes
• A full RNS variant of approximate homomorphic encryption
• Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys
• Efficient homomorphic conversion between (ring) LWE ciphertexts
• Faster homomorphic encryption over GPGPUs via hierarchical DGT
• Approximate homomorphic encryption with reduced approximation error
• FASTA -- a stream cipher for fast FHE evaluation
• TFHE: fast fully homomorphic encryption over the torus
• SLAP: simpler, improved private stream aggregation from ring learning with errors
• 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
• On the Hardness of Scheme-Switching Between SIMD FHE Schemes
• Amortized bootstrapping revisited: simpler, asymptotically-faster, implemented
• Turtle wins rabbit again: faster modulus reduction for RNS-CKKS
• Homomorphic encryption for large integers from nested residue number systems
• Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields
• Revisiting key decomposition techniques for FHE: simpler, faster and more generic
• Towards practical doubly-efficient private information retrieval
• CRT representation of LWE based TFHE
• Secure federated Boolean count queries using fully-homomorphic cryptography
• Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth
• Leveled homomorphic encryption schemes for homomorphic encryption standard
• Improved radix-based approximate homomorphic encryption for large integers via lightweight bootstrapped digit carry
• Designs for practical SHE schemes based on Ring-LWR
• HRA-secure homomorphic lattice-based proxy re-encryption with tight security
• Tagged-FHE: strong syntax, stronger security, and standard model
• Faster bootstrapping for CKKS with less modulus consumption
• Algorithmic acceleration of B/FV-like somewhat homomorphic encryption for compute-enabled RAM

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

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