An Improved RNS Variant of the BFV Homomorphic Encryption Scheme

By Shai Halevi, Yuriy Polyakov, Victor Shoup. 2019

245 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

1. Kim Laine
2. Wei Dai
3. M. Sadegh Riazi
4. Blake Pelton
5. Hao Chen
6. Kimmo U. Järvinen
7. Sujoy Sinha Roy
8. Ingrid M. R. Verbauwhede

In Information Systems

1. Wei Dai
2. Kim Laine
3. M. Sadegh Riazi
4. Blake Pelton
5. Hao Chen
6. Miran Kim
7. Yongsoo Song
8. Furkan Turan

Citations in the corpus

• HEAX: An Architecture for Computing on Encrypted Data (2019, methodology): “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”
• FPGA-Based High-Performance Parallel Architecture for Homomorphic Computing on Encrypted Data (2019, methodology): “HPS paper [29] uses floating point divisions for this purpose.”
• 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.”
• 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.”
• Implementation and Performance Evaluation of RNS Variants of the BFV Homomorphic Encryption Scheme (2019, methodology): “Following a conservative (worstcase) approach, δ is set to n; however, in practical settings δ can often be set to 2 √ n if the requirements for the Central Limit Theorem are met [19].”
• OpenFHE: Open-Source Fully Homomorphic Encryption Library (2022, unknown): “These four variants are: • HPS: the homomorphic multiplication and decryption are implemented using the RNS procedures proposed by Halevi, Polyakov, and Shoup [41].”