Faster Homomorphic Evaluation of Arbitrary Bivariate Integer Functions via Homomorphic Linear Transformation
Open Access
- 19 November 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 76-86
Abstract
Fully homomorphic encryption (FHE) can perform computations on encrypted data, allowing us to analyze sensitive data while maintaining security. Several popular FHE schemes, such as BGV and BFV, are suitable for arithmetic circuits. However, there is still much room for improving the efficiency of the evaluation of non-linear functions in those schemes. We propose an efficient method for the evaluation of arbitrary bivariate functions in homomorphic encryption with integers as plaintext. Prior work on arbitrary bivariate function evaluation for relatively large plaintext integers has been proposed by Maeda et al. (WAHC'22). In the method of Maeda et al., the polynomial evaluation is the most time-consuming part in terms of the execution time. In this work, we construct a method for arbitrary bivariate functions based on homomorphic linear transformations, eliminating the need for polynomial evaluation to enhance efficiency. We also provide a time complexity analysis showing that our method achieves lower time computational complexity. In addition, we implement the previous method of Maeda et al. and our proposed method using OpenFHE with the input domain {0, 1,..., 2^15 - 1} and demonstrate that our method achieves a 1.38 times speed up for the division function compared to the previous method.Keywords
This publication has 20 references indexed in Scilit:
- Revisiting Homomorphic Encryption Schemes for Finite Fields2021
- Better Bootstrapping for Approximate Homomorphic Encryption2020
- Linear Depth Integer-Wise Homomorphic Division2019
- An Improved RNS Variant of the BFV Homomorphic Encryption Scheme2019
- A Full RNS Variant of Approximate Homomorphic Encryption2019
- Faster Homomorphic Linear Transformations in HElib2018
- Homomorphic Encryption for Arithmetic of Approximate Numbers2017
- A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes2017
- Fully Homomorphic Encryption with Polylog Overhead2012
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP2012