Skip to main content

A Privacy-Preserving Face Recognition Scheme Combining Homomorphic Encryption and Parallel Computing

  • Conference paper
  • First Online:
Artificial Intelligence Security and Privacy (AIS&P 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14510))

  • 149 Accesses

Abstract

Face recognition technology is widely used in various fields, such as law enforcement, payment systems, transportation, and access control. Traditional face authentication systems typically establish a facial feature template database for identity verification. However, this approach poses various security risks, such as the risk of plaintext feature data stored in cloud databases being leaked or stolen. To address these issues, in recent years, a face recognition technology based on homomorphic encryption has gained attention. Based on homomorphic encryption, face recognition can encrypt facial feature values and achieve feature matching without exposing the feature information. However, due to the encryption, face recognition in the ciphertext domain often requires considerable time. In this paper, we introduce the big data stream processing engine Flink to achieve parallel computation of face recognition in the ciphertext domain based on homomorphic encryption. We analyze the security, accuracy, and acceleration of this approach. Ultimately, we verify that this approach achieves recognition accuracy close to plaintext and significant efficiency improvement.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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_15

    Chapter  Google Scholar 

  2. Titus, A.J., Kishore, S., Stavish, T., Rogers, S.M., Ni, K.: Pyseal: a python wrapper implementation of the seal homomorphic encryption library (2018)

    Google Scholar 

  3. Li, Y., Ng, K.S., Purcell, M.: A tutorial introduction to lattice-based cryptography and homomorphic encryption (2022)

    Google Scholar 

  4. Dowerah, U., Krishnaswamy, S.: Towards an efficient LWE-based fully homomorphic encryption scheme. IET Inf. Secur. 16(4), 16 (2022)

    Article  Google Scholar 

  5. Xiaoming D., Department, E.T.: Research on fully homomorphic encryption schems. Electronics World (2016)

    Google Scholar 

  6. Zhang, Z., Cheng, P., Chen, J., Wu, J.: Secure state estimation using hybrid homomorphic encryption scheme. IEEE Trans. Control Syst. Technol. 29, 1704–1720 (2020)

    Article  Google Scholar 

  7. Wang, Y., Liang, X., Hei, X., Ji, W., Zhu, L.: Deep learning data privacy protection based on homomorphic encryption in aiot. Mob. Inf. Syst. 2021(2), 1–11 (2021)

    Google Scholar 

  8. Park, J., Kim, D.S., Lim, H.: Privacy-preserving reinforcement learning using homomorphic encryption in cloud computing infrastructures. IEEE Access 8, 203564–203579 (2020)

    Article  Google Scholar 

  9. Aloufi, A., Hu, P., Song, Y., Lauter, K.: Computing blindfolded on data homomorphically encrypted under multiple keys: a survey. ACM Comput. Surv. (CSUR) 54, 1–37 (2021)

    Article  Google Scholar 

  10. Yang, X., Yi, X., Kelarev, A., Han, F., Luo, J.: A distributed networked system for secure publicly verifiable self-tallying online voting. Inf. Sci. 543, 125–142 (2021)

    Article  MathSciNet  Google Scholar 

  11. Xu, W., Wang, B., Hu, Y., Duan, P., Zhang, B., Liu, M.: Multi-key fully homomorphic encryption from additive homomorphism. Comput. J. 66(1), 197–207 (2023)

    Article  MathSciNet  Google Scholar 

  12. Fang, H., Qian, Q., Chen, M.L.: Privacy preserving machine learning with homomorphic encryption and federated learning. Future Internet 13, 94 (2021)

    Article  Google Scholar 

  13. Wibawa, F., Ozgur Catak, F., Sarp, S., Kuzlu, M., Cali, U.: Homomorphic encryption and federated learning based privacy-preserving cnn training: Covid-19 detection use-case. arXiv e-prints (2022)

    Google Scholar 

  14. Zhang, J., Jiang, Z.L., Li, P., Yiu, S.M.: Privacy-preserving multikey computing framework for encrypted data in the cloud. Inf. Sci. 575, 217–230 (2021)

    Article  MathSciNet  Google Scholar 

  15. Park, J.H.: Homomorphic encryption based privacy-preservation for iomt. Appl. Sci. 11, 8757 (2021)

    Article  Google Scholar 

  16. Mohammed, S., Basheer, D.: From cloud computing security towards homomorphic encryption: a comprehensive review. TELKOMNIKA (Telecommunication Computing Electronics and Control) (2021)

    Google Scholar 

  17. Gentry, C., Halevi, S., Smart, N.P.: Better bootstrapping in fully homomorphic encryption. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 1–16. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30057-8_1

    Chapter  Google Scholar 

  18. Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20465-4_9

    Chapter  Google Scholar 

  19. Tibouchi, M.: Fully homomorphic encryption over the integers: from theory to practice. NTT Techn. Rev. 12(7), 273–81 (2014)

    Google Scholar 

  20. Zhao, D.: Rache: radix-additive caching for homomorphic encryption (2022)

    Google Scholar 

  21. 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_1

    Chapter  Google Scholar 

  22. Ertaul, L.: Implementation of homomorphic encryption schemes for secure packet forwarding in mobile ad hoc networks (manets) (2022)

    Google Scholar 

  23. Ma, Y., Wu, L., Gu, X., He, J., Yang, Z.: A secure face-verification scheme based on homomorphic encryption and deep neural networks. IEEE Access 5, 16532–16538 (2017)

    Article  Google Scholar 

  24. Jin, X., Liu, Y., Li, X., Zhao, G., Guo, K.: Privacy preserving face identification in the cloud through sparse representation. In: Chinese Conference on Biometric Recognition (2015)

    Google Scholar 

  25. Osadchy, M., Pinkas, B., Jarrous, A., Moskovich, B.: Scifi - a system for secure face identification. In: IEEE Symposium on Security & Privacy (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weipeng Xie .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, G., Zheng, X., Zeng, L., Xie, W. (2024). A Privacy-Preserving Face Recognition Scheme Combining Homomorphic Encryption and Parallel Computing. In: Vaidya, J., Gabbouj, M., Li, J. (eds) Artificial Intelligence Security and Privacy. AIS&P 2023. Lecture Notes in Computer Science, vol 14510. Springer, Singapore. https://doi.org/10.1007/978-981-99-9788-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-99-9788-6_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-99-9787-9

  • Online ISBN: 978-981-99-9788-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics