Scholarlink

Privacy-Preserving Deep Learning (PPDL) using Fully Homomorphic Encryption (FHE) addresses potential data privacy exposure risks associated with deploying deep learning models in untrusted cloud environments. FHE-based PPDL enables users to encrypt their data locally, allowing cloud service providers to perform computations directly on the encrypted data without ever accessing it. However, FHE faces challenges in efficiently handling nonlinear computations, which are essential to deep learning frameworks, particularly in implementing activation functions and max pooling layers. To address this challenge, we improve the homomorphic max pooling approximation scheme HMaxPool, and propose an efficient homomorphic max pooling algorithm, denoted as \(HMaxPool^+\) . Specifically, we first redefine the approximation of the maximum function, and then design sub-algorithm to address the potential output expansion issue. The experimental results validate that both the homomorphic max pooling algorithm itself and the corresponding homomorphic SqueezeNet neural network demonstrate enhancements in computational efficiency and accuracy.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Efficient Homomorphic Approximation of Max Pooling for Privacy-Preserving Deep Learning

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Peng Zhang,
  • Dongyan Qiu,
  • Ao Duan,
  • Hongwei Liu

摘要

Privacy-Preserving Deep Learning (PPDL) using Fully Homomorphic Encryption (FHE) addresses potential data privacy exposure risks associated with deploying deep learning models in untrusted cloud environments. FHE-based PPDL enables users to encrypt their data locally, allowing cloud service providers to perform computations directly on the encrypted data without ever accessing it. However, FHE faces challenges in efficiently handling nonlinear computations, which are essential to deep learning frameworks, particularly in implementing activation functions and max pooling layers. To address this challenge, we improve the homomorphic max pooling approximation scheme HMaxPool, and propose an efficient homomorphic max pooling algorithm, denoted as \(HMaxPool^+\) . Specifically, we first redefine the approximation of the maximum function, and then design sub-algorithm to address the potential output expansion issue. The experimental results validate that both the homomorphic max pooling algorithm itself and the corresponding homomorphic SqueezeNet neural network demonstrate enhancements in computational efficiency and accuracy.