Top

Published in:

2021 | OriginalPaper | Chapter

A Survey on Privacy-Preserving Machine Learning with Fully Homomorphic Encryption

Authors : Luis Bernardo Pulido-Gaytan, Andrei Tchernykh, Jorge M. Cortés-Mendoza, Mikhail Babenko, Gleb Radchenko

Published in: High Performance Computing

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

The secure and efficient processing of private information in the cloud computing paradigm is still an open issue. New security threats arise with the increasing volume of data into cloud storage, where cloud providers require high levels of trust, and data breaches are significant problems. Encrypting the data with conventional schemes is considered the best option to avoid security problems. However, a decryption process is necessary when the data must be processed, but it falls into the initial problem of data vulnerability. The user cannot operate on the data directly and must download it to perform the computations locally. In this context, Fully Homomorphic Encryption (FHE) is considered the holy grail of cryptography in order to solve cybersecurity problems, it allows a non-trustworthy third-party resource to blindly process encrypted information without disclosing confidential data. FHE is a valuable capability in a world of distributed computation and heterogeneous networking. In this survey, we present a comprehensive review of theoretical concepts, state-of-the-art, limitations, potential applications, and development tools in the domain of FHE. Moreover, we show the intersection of FHE and machine learning from a theoretical and a practical point of view and identify potential research directions to enrich Machine Learning as a Service, a new paradigm of cloud computing. Specifically, this paper aims to be a guide to researchers and practitioners interested in learning, applying, and extending knowledge in FHE over machine learning.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

previous chapter Using HPC as a Competitive Advantage in an International Robotics Challenge

next chapter Distributed Greedy Approach for Autonomous Surveillance Using Unmanned Aerial Vehicles

Player, R.: Parameter selection in lattice-based cryptography. Royal Holloway, University of London, Ph.D. Thesis (2017)

Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120–126 (1978). https://doi.org/10.1145/359340.359342MathSciNetCrossRefMATH

Rivest, R.L., Dertouzos, M.L., Adleman, L.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4, 160–179 (1978)

ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 469–472 (1985). https://doi.org/10.1109/TIT.1985.1057074MathSciNetCrossRefMATH

Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48910-X_16CrossRef

Minelli, M.: Fully homomorphic encryption for machine learning. PSL Research University, Ph.D. Thesis (2018)

Gentry, C.: A fully homomorphic encryption scheme. Stanford University, Ph.D. Thesis (2009)

van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24–43. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_2CrossRef

Chillotti, I., Gama, N., Georgieva, M., Izabachène, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 3–33. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53887-6_1CrossRefMATH

10.

Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 97–106 (2011)

11.

Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference - ITCS 2012, pp. 309–325 (2012)

12.

Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75–92. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40041-4_5CrossRef

13.

Gentry, C.: Computing arbitrary functions of encrypted data. Commun. ACM 53, 97–105 (2010). https://doi.org/10.1145/1666420.1666444CrossRefMATH

14.

Rohloff, K., Cousins, D.B.: A Scalable implementation of fully homomorphic encryption built on NTRU. In: Böhme R., Brenner M., Moore T., Smith M. (eds.) Financial Cryptography and Data Security, FC 2014, pp. 221–234 (2014)

15.

Hiromasa, R., Abe, M., Okamoto, T.: Packing messages and optimizing bootstrapping in GSW-FHE. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 699–715. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46447-2_31CrossRef

16.

Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 297–314. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44371-2_17CrossRef

17.

Aslett, L.J.M., Esperança, P.M., Holmes, C.C.: A review of homomorphic encryption and software tools for encrypted statistical machine learning (2015)

18.

Armknecht, F., et al.: A guide to fully homomorphic encryption. IACR Cryptology ePrint Archive (2015)

19.

Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: 3rd ACM Workshop on Cloud Computing Security Workshop - CCSW 2011, pp. 113–124 (2011)

20.

Archer, D., et al.: Applications of homomorphic encryption (2017)

21.

Acar, A., Aksu, H., Selcuk Uluagac, A., Aksu, H., Uluagac, A.S.: A survey on homomorphic encryption schemes: theory and implementation. ACM Comput. Surv. 51, 1–35 (2018). https://doi.org/10.1145/3214303CrossRef

22.

Martins, P., Sousa, L., Mariano, A.: A survey on fully homomorphic encryption: an engineering perspective. ACM Comput. Surv. 50, 33 (2017). https://doi.org/10.1145/3124441CrossRef

23.

Parmar, P.V., et al.: Survey of various homomorphic encryption algorithms and schemes. Int. J. Comput. Appl. 91(8), 26–32 (2014)

24.

Vaikuntanathan, V.: Computing blindfolded: new developments in fully homomorphic encryption. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, pp. 5–16 (2011)

25.

Sobitha Ahila, S., Shunmuganathan, K.L.: State of art in homomorphic encryption schemes. Int. J. Eng. Res. Appl. 4, 37–43 (2014)

26.

Gentry, C.: Computing on the edge of chaos: structure and randomness in encrypted computation. In: Proceedings of the International Congress of Mathematicians (2014)

27.

Aguilar-Melchor, C., Fau, S., Fontaine, C., Gogniat, G., Sirdey, R.: Recent advances in homomorphic encryption: a possible future for signal processing in the encrypted domain. IEEE Signal Process. Mag. 30, 108–117 (2013). https://doi.org/10.1109/MSP.2012.2230219CrossRef

28.

Hrestak, D., Picek, S.: Homomorphic encryption in the cloud. In: 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO 2014), pp. 1400–1404 (2014)

29.

Moore, C., O’Neill, M., Hanley, N., O’Sullivan, E.: Accelerating integer-based fully homomorphic encryption using Comba multiplication. In: IEEE Workshop on Signal Processing Systems, SiPS, pp. 1–6. IEEE (2014)

30.

Hunt, T., Song, C., Shokri, R., Shmatikov, V., Witchel, E.: Chiron: privacy-preserving machine learning as a service (2018)

31.

Bost, R., Popa, R.A., Tu, S., Goldwasser, S.: Machine learning classification over encrypted data. In: Network and Distributed System Security Symposium (2015)

32.

Khedr, A., Gulak, G., Member, S., Vaikuntanathan, V.: SHIELD: scalable homomorphic implementation of encrypted data-classifiers. IEEE Trans. Comput. 65, 2848–2858 (2015). https://doi.org/10.1109/TC.2015.2500576MathSciNetCrossRefMATH

33.

Dowlin, N., Gilad-Bachrach, R., Laine, K., Lauter, K., Naehrig, M., Wernsing, J.: CryptoNets: applying neural networks to encrypted data with high throughput and accuracy. In: 33rd International Conference on Machine Learning, pp. 201–210 (2016)

34.

Chabanne, H., De Wargny, A., Milgram, J., Morel, C., Prouff, E.: Privacy-preserving classification on deep neural network (2017)

35.

Badawi, A.Al., et al.: The AlexNet moment for homomorphic encryption: HCNN, the first homomorphic CNN on encrypted data with GPUs (2018)

36.

Zhang, Q., Yang, L.T., Chen, Z.: Privacy preserving deep computation model on cloud for big data feature learning. IEEE Trans. Comput. 65, 1351–1362 (2016). https://doi.org/10.1109/TC.2015.2470255MathSciNetCrossRefMATH

37.

Takabi, H., Hesamifard, E., Ghasemi, M.: Privacy preserving multi-party machine learning with homomorphic encryption. In: 29th Annual Conference on Neural Information Processing Systems (2016)

38.

Phong, L.T., Aono, Y., Hayashi, T., Wang, L., Moriai, S.: Privacy-preserving deep learning via additively homomorphic encryption. IEEE Trans. Inf. Forensics Secur. 13, 1333–1345 (2018). https://doi.org/10.1109/TIFS.2017.2787987CrossRef

39.

Wagh, S., Gupta, D., Chandran, N.: SecureNN: 3-party secure computation for neural network training. Proc. Priv. Enhancing Technol. 2019, 26–49 (2019). https://doi.org/10.2478/popets-2019-0035CrossRef

40.

Babenko, M., et al.: Positional characteristics for efficient number comparison over the homomorphic encryption. Program. Comput. Softw. 45(8), 532–543 (2019). https://doi.org/10.1134/S0361768819080115MathSciNetCrossRef

41.

Bos, J.W., Lauter, K., Naehrig, M.: Private predictive analysis on encrypted medical data. J. Biomed. Inform. 50, 234–243 (2014). https://doi.org/10.1016/j.jbi.2014.04.003CrossRef

42.

Xu, C., Chen, J., Wu, W., Feng, Y.: Homomorphically encrypted arithmetic operations over the integer ring. In: Bao, F., Chen, L., Deng, R.H., Wang, G. (eds.) ISPEC 2016. LNCS, vol. 10060, pp. 167–181. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49151-6_12CrossRef

43.

Aono, Y., Hayashi, T., Phong, L.T., Wang, L.: Scalable and secure logistic regression via homomorphic encryption. In: 6th ACM Conference on Data and Application Security and Privacy - CODASPY 2016, pp. 142–144 (2016)

44.

Costache, A., Smart, N.P., Vivek, S.: Faster homomorphic evaluation of discrete fourier transforms. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 517–529. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70972-7_29CrossRef

45.

Kim, A., Song, Y., Kim, M., Lee, K., Cheon, J.H.: Logistic regression model training based on the approximate homomorphic encryption. BMC Med. Genomics 11, 83 (2018). https://doi.org/10.1186/s12920-018-0401-7CrossRef

46.

Coron, J.-S., Lepoint, T., Tibouchi, M.: Scale-invariant fully homomorphic encryption over the integers. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 311–328. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54631-0_18CrossRef

47.

Chen, H., Laine, K., Player, R.: Simple Encrypted arithmetic library (2019)

48.

Halevi, S., Shoup, V.: Design and implementation of a homomorphic-encryption library (2013)

49.

PALISADE. https://palisade-crypto.org/community

50.

Dai, W., Sunar, B.: cuHE: a homomorphic encryption accelerator library. In: Pasalic, E., Knudsen, Lars R. (eds.) BalkanCryptSec 2015. LNCS, vol. 9540, pp. 169–186. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-29172-7_11CrossRef

51.

Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409–437. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70694-8_15CrossRef

52.

Boemer, F., Lao, Y., Cammarota, R., Wierzynski, C.: NGraph-HE: a graph compiler for deep learning on homomorphically encrypted data. In: Proceedings of the 16th ACM International Conference on Computing Frontiers, pp. 3–13 (2019)

Title: A Survey on Privacy-Preserving Machine Learning with Fully Homomorphic Encryption
Authors: Luis Bernardo Pulido-Gaytan
Andrei Tchernykh
Jorge M. Cortés-Mendoza
Mikhail Babenko
Gleb Radchenko
Publisher: Springer International Publishing
Book: High Performance Computing
Print ISBN: 978-3-030-68034-3

Electronic ISBN: 978-3-030-68035-0

Copyright Year: 2021
DOI: https://doi.org/10.1007/978-3-030-68035-0_9

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner