Abstract
Fully homomorphic encryption (FHE), which is used to evaluate arbitrary functions in addition and multiplication operations via modular arithmetic (mod q) over ciphertext, can be applied in various privacy-preserving applications. However, big data is difficult to adopt owing to its high computational cost and the challenges associated with the efficient handling of complex functions such as log(x). To address these problems, we propose a method for handling any multi-input function using a lookup table (LUT) to replace the original calculations with array indexing operations over integer-based FHE. In this study, we extend our LUT-based method to handle any input values, i.e., including non-matched element values in the LUT, to match with a near indexed value and return an approximated output over FHE. In addition, we propose a technique for splitting the table to handle large integers for improved accuracy with only a slight increase in the execution time. For the experiments, we use the Microsoft/SEAL library, and the results show that our proposed method can evaluate a 16-bit to 16-bit function in 2.110 s and a 16-bit to 32-bit function in 2.268 s, thereby outperforming previous methods implemented via bit-wise calculation over FHE.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Zhang, D.: Big data security and privacy protection. In: Proceedings of the 8th International Conference on Management and Computer Science (ICMCS 2018), pp. 275–278. Atlantis Press (2018)
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169–178 (2009)
Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012, 144 (2012)
Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. LNCS, vol. 7417, pp. 868–886 (2012)
Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. LNCS, vol. 8042, pp. 75–92 (2013)
Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrap**. ACM Trans. Comput. Theory (TOCT) 6(3), 1–36 (2014)
Boneh, D., Gentry, C., Halevi, S., et al.: Private database queries using somewhat homomorphic encryption. LNCS, vol. 7954, pp. 102–118 (2013)
Aguilar-Melchor, C., Barrier, J., Fousse, L., et al.: XPIR: private information retrieval for everyone. In: Proceedings on Privacy Enhancing Technologies, vol. 2, pp. 155–174 (2016)
Angel, S., Chen, H., Laine, K., et al.: PIR with compressed queries and amortized query. In: Proceedings of the 2018 IEEE Symposium on Security and Privacy (S&P), pp. 962–979. IEEE (2018)
Crawford, J.L.H., Gentry, C., Halevi, S., et al.: Doing real work with FHE: the case of logistic regression. In: Proceedings of the 6th Workshop on Encrypted Computing & Applied Homomorphic Cryptography, pp. 1–12 (2018)
Chillotti, I., Gama, N., Georgieva, M., et al.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34–91 (2020)
Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 1–12 (2014)
Chillotti, I., Gama, N., Georgieva, M., et al.: Faster fully homomorphic encryption: bootstrap** in less than 0.1 seconds. LNCS, vol. 10031, pp. 3–33 (2016)
Li, R., Ishimaki, Y., Yamana, H.: Privacy preserving calculation in cloud using fully homomorphic encryption with table lookup. In: Proceedings of the 2020 5th IEEE International Conference on Big Data Analytics (ICBDA), pp. 315–322. IEEE (2020)
Microsoft Research, Redmond, WA, Microsoft SEAL (release 3.2) (2019). https://github.com/Microsoft/SEAL
Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Des. Codes Crypt. 71(1), 57–81 (2014)
Chor, B., Goldreich, O., Kushilevitz, E., et al.: Private information retrieval. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 41–50. IEEE (1995)
Kushilevitz, E., Ostrovsky, R.: One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. LNCS, vol. 1807, pp. 104–121 (2000)
Li, R., Ishimaki, Y., Yamana, H.: Fully homomorphic encryption with table lookup for privacy-preserving smart grid. In: Proceedings of the 2019 IEEE International Conference on Smart Computing (SMARTCOMP), pp. 19–24. IEEE (2019)
Acknowledgement
This work was supported by JST CREST(Grant Number JPMJCR1503), and Japan and Japan–US Network Opportunity 2 by Commissioned Research of the National Institute of Information and Communications Technology (NICT), Japan.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Li, R., Yamana, H. (2021). Fast and Accurate Function Evaluation with LUT over Integer-Based Fully Homomorphic Encryption. In: Barolli, L., Woungang, I., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2021. Lecture Notes in Networks and Systems, vol 226. Springer, Cham. https://doi.org/10.1007/978-3-030-75075-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-030-75075-6_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-75074-9
Online ISBN: 978-3-030-75075-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)