A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes
By Jean-Claude Bajard, Julien Eynard, Anwar Hasan, Vincent Zucca. 2016
279 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Information Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Information Systems
Citations in the corpus
- HEAX: An Architecture for Computing on Encrypted Data (2019, background): “n R q, denoted by c =Func(a;b), can be performed on their RNS representation: for all i =0;1;:::;L, compute c i = Func(a i;b i) in R pi . There exist full-RNS variants of HE schemes, such as those in [7, 37, 16], which do not require any RNS conversions except in decryption and show significant impro”
- Simple Encrypted Arithmetic Library - SEAL v2.1 (2016, methodology): “The FV scheme has been implemented in [9, 1], both of which use the ideal lattice library NFLlib [31].”
- Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network Inference (2019, methodology): “In particular, it has been studied how to design full-RNS variants of BFV and CKKS [4, 15, 30], which do not require any RNS conversions.”
- CHET: Compiler and Runtime for Homomorphic Evaluation of Tensor Programs (2018, methodology): “For example, by using a full-RNS variant of the HEAAN scheme and storing the ciphertexts and plaintexts in the number-theoretic-transform (NTT) domain, we can decrease the complexity of mulPlain* from O(n log(n)) to O(n).”
- Faster CryptoNets: Leveraging Sparsity for Real-World Encrypted Inference (2018, methodology): “Bajard et al. [9] proposed an encryption scheme, FV-RNS, which is a residue number system (RNS) variant of the FV encryption scheme.”
- OpenFHE: Open-Source Fully Homomorphic Encryption Library (2022, unknown): “• BEHZ: the homomorphic multiplication and decryption are implemented using the RNS procedures described by Bajard, Eynard, Hasan, and Zucca [9].”
- HEAX: High-Performance Architecture for Computation on Homomorphically Encrypted Data in the Cloud (2019, methodology): “There exist full-RNS variants of HE schemes, such as those in [7, 37, 16], which do not require any RNS conversions except in decryption and show significant improvement over non-RNS variants.”
- TFHE: Fast Fully Homomorphic Encryption Over the Torus (2019, result): “Optimized residue number system (RNS) implementation variants of BFV [9,45] and HEEAN [19] have recently been proposed and show a significant performance gain compared to their earlier respective implementation.”
- Simple Encrypted Arithmetic Library-SEAL (2017, methodology): “The FV scheme has been implemented in [9, 1], both of which use the ideal lattice library NFLlib [31].”
- Labeled PSI from Fully Homomorphic Encryption with Malicious Security (2018, methodology): “We chose to use the homomorphic encryption library SEAL1, which implements the variant of [4] of the Brakerski/Fan-Vercauteren (BFV) scheme [22].”
- Implementation and Performance Evaluation of RNS Variants of the BFV Homomorphic Encryption Scheme (2019, methodology): “Algorithm 2: SmMRq~ m: Small Montgomery Reduction Mod q [9] Input: polynomial c00 1⁄4 1⁄2~ mc q þ v q in q0 [ fmsk; ~ mg Output: c0 in q0 [ msk, with c0 c00 ~ m 1 ðmod qÞ, kck1 kc 00k1 ~ m þ q2.”
- Simple Encrypted Arithmetic Library v2.3.0 (2017, methodology): “0 implements the method of [4] which has slightly different noise growth properties than textbook-FV, but these differences are small and in practice have no effect for the parameters used in SEAL v2.”