Privacy-Preserving High-Resolution Image Gradient Computation Based on Fully Homomorphic Encryption

• URL: http://arxiv.org/abs/2606.03513v1
• Date: Tue, 02 Jun 2026 11:32:15 GMT
• Title: Privacy-Preserving High-Resolution Image Gradient Computation Based on Fully Homomorphic Encryption
• Abstract summary: homomorphic encryption (HE) has emerged as a core method for privacy-preserving image processing.<n>We propose a multi-text privacy-preserving framework for large images, enabling efficient image encryption and computation under the semi-honest model.
• Score: 1.342943588774946
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With growing emphasis on privacy protection, homomorphic encryption (HE) has emerged as a core method for privacy-preserving image processing, as it enables operations directly on encrypted data. However, existing research predominantly focuses on low-resolution image processing, and techniques for privacy-preserving high-resolution image processing remain underexplored. As the image size increases, the HE parameters must be adjusted accordingly, and directly applying existing methods can lead to significant computational overhead. In this work, we propose a multi-ciphertext privacy-preserving framework for large images, enabling efficient image encryption and computation under the semi-honest model. Specifically, we divide the large image into multiple sub-images, which allows us to maintain smaller HE parameters and reduce key size. By parallel processing the sub-image ciphertexts and introducing a new bootstrapping placement strategy, we significantly reduce encryption overhead and enhance user experience. On the server side, we optimize the large image convolution operation through a repeated packing technique and implement the Sobel operator computation based on HE. To improve gradient direction calculation for the Sobel operator, we introduce a new polynomial approximation method for the reciprocal function based on the sign function, which can be applied to other HE-based protocols.

Related papers

• Volley Revolver: A Novel Matrix-Encoding Method for Privacy-Preserving Deep Learning (Inference++) [0.0]
  Homomorphic encryption has emerged as a promising approach for enabling secure machine learning in untrusted environments.<n>In this paper, we propose an improved encoding and computation framework that removes the requirement that a single encrypted ciphertext must fully contain one input image.<n>Our method reformulates the data layout and homomorphic operations to partition high-resolution inputs across multiple ciphertexts.
  arXiv  Detail & Related papers  (2025-12-21T08:40:31Z)
• ROI-based Deep Image Compression with Implicit Bit Allocation [15.62284701009422]
  Region of Interest (ROI)-based image compression has rapidly developed due to its ability to maintain high fidelity in important regions.<n>Existing compression methods apply masks to suppress background information before quantization.<n>This work proposes an efficient ROI-based deep image compression model with implicit bit allocation.
  arXiv  Detail & Related papers  (2025-11-12T02:55:18Z)
• Privacy-Shielded Image Compression: Defending Against Exploitation from Vision-Language Pretrained Models [32.92388946423273]
  This paper seeks to protect users' privacy by implementing defenses at the image compression stage to prevent exploitation.<n>We propose a flexible coding method, termed Privacy-Shielded Image Compression (PSIC), that can produce bitstreams with multiple decoding options.<n>The proposed scheme is plug-and-play and can be seamlessly integrated into most existing Learned Image Compression (LIC) models.
  arXiv  Detail & Related papers  (2025-06-18T07:29:40Z)
• Enabling Practical and Privacy-Preserving Image Processing [5.526464269029825]
  Homomorphic Encryption (FHE) enables computations on encrypted data, preserving confidentiality without the need for decryption. Traditional FHE methods often encrypt images by monolithic data blocks, instead of pixels. We propose and implement a pixel-level homomorphic encryption approach, iCHEETAH, based on the CKKS scheme.
  arXiv  Detail & Related papers  (2024-09-05T14:22:02Z)
• Beyond Learned Metadata-based Raw Image Reconstruction [86.1667769209103]
  Raw images have distinct advantages over sRGB images, e.g., linearity and fine-grained quantization levels. They are not widely adopted by general users due to their substantial storage requirements. We propose a novel framework that learns a compact representation in the latent space, serving as metadata.
  arXiv  Detail & Related papers  (2023-06-21T06:59:07Z)
• Raw Image Reconstruction with Learned Compact Metadata [61.62454853089346]
  We propose a novel framework to learn a compact representation in the latent space serving as the metadata in an end-to-end manner. We show how the proposed raw image compression scheme can adaptively allocate more bits to image regions that are important from a global perspective.
  arXiv  Detail & Related papers  (2023-02-25T05:29:45Z)
• Rank-Enhanced Low-Dimensional Convolution Set for Hyperspectral Image Denoising [50.039949798156826]
  This paper tackles the challenging problem of hyperspectral (HS) image denoising. We propose rank-enhanced low-dimensional convolution set (Re-ConvSet) We then incorporate Re-ConvSet into the widely-used U-Net architecture to construct an HS image denoising method.
  arXiv  Detail & Related papers  (2022-07-09T13:35:12Z)
• Implicit Neural Representations for Image Compression [103.78615661013623]
  Implicit Neural Representations (INRs) have gained attention as a novel and effective representation for various data types. We propose the first comprehensive compression pipeline based on INRs including quantization, quantization-aware retraining and entropy coding. We find that our approach to source compression with INRs vastly outperforms similar prior work.
  arXiv  Detail & Related papers  (2021-12-08T13:02:53Z)
• FeatMatch: Feature-Based Augmentation for Semi-Supervised Learning [64.32306537419498]
  We propose a novel learned feature-based refinement and augmentation method that produces a varied set of complex transformations. These transformations also use information from both within-class and across-class representations that we extract through clustering. We demonstrate that our method is comparable to current state of art for smaller datasets while being able to scale up to larger datasets.
  arXiv  Detail & Related papers  (2020-07-16T17:55:31Z)
• The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
  We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors. We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS. To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
  arXiv  Detail & Related papers  (2020-05-16T08:17:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.