PixCrypt: Fast Fine-Grained FHE with Range-Aware Caching

• URL: http://arxiv.org/abs/2609.14137v1
• Date: Sat, 12 Sep 2026 20:37:31 GMT
• Title: PixCrypt: Fast Fine-Grained FHE with Range-Aware Caching
• Abstract summary: We present PixCrypt, a caching-based acceleration mechanism for fine-grained fully homomorphic encryption.<n>Experiments on five real-world pixel-level image processing tasks show that PixCrypt significantly improves the practicality of FHE for privacy-preserving analytics.
• Score: 14.589534842545937
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many analytics tasks require secure computation over encrypted data. In particular, fine-grained data such as pixel-level images require higher precision, as every pixel can directly affect outcomes in tasks like tumor segmentation and anomaly detection. While Multi-Party Computation (MPC) is interactive, Differential Privacy (DP) protects only aggregate values, and Partially Homomorphic Encryption (PHE) lacks multiplicative support, none of them can efficiently handle fine-grained data analytics. Fully Homomorphic Encryption (FHE) uniquely enables arbitrary operations on encrypted pixels but remains computationally expensive, posing significant challenges for both software and hardware accelerators. We present PixCrypt, a caching-based acceleration mechanism for fine-grained fully homomorphic encryption. PixCrypt replaces expensive fresh ciphertext generation with cache retrieval and coefficient-level operations across CKKS, BFV, and BGV, while randomized reconstruction ensures that ciphertexts do not repeat. Its linear noise growth reduces the need for bootstrapping and lowers NTT load, improving hardware accelerator efficiency. This design yields up to 35x faster fine-grained encryption and maintains IND-CPA (Indistinguishability under Chosen Plaintext Attack) security. Experiments on five real-world pixel-level image processing tasks show that PixCrypt significantly improves the practicality of FHE for privacy-preserving analytics.

Related papers

• Memory-Efficient Designs for Word-Wise Universal Fully Homomorphic Encryption [13.384404337894575]
  Homomorphic Encryption (FHE) enables computation on encrypted data, preserving privacy throughout analysis.<n>We propose BXT, an FHE optimization framework that mitigates the memory bottleneck through four techniques.<n>On CNN inference, the BXT-CSO50 configuration effectively achieves up to 3.8$times$ speedup over the 100x GPU baseline with less than 1% accuracy loss at 50% comparison precision.
  arXiv  Detail & Related papers  (2026-09-04T06:03:44Z)
• FedBit: Accelerating Privacy-Preserving Federated Learning via Bit-Interleaved Packing and Cross-Layer Co-Design [2.255961793913651]
  Federated learning (FL) with fully homomorphic encryption (FHE) effectively safeguards data privacy during model aggregation.<n>FedBit is a hardware/software co-designed framework for the Brakerski-Fan-Vercauteren (BFV) scheme.<n>FedBit employs bit-interleaved data packing to embed multiple model parameters into a single ciphertext coefficient.
  arXiv  Detail & Related papers  (2025-09-27T03:58:16Z)
• Secure and Scalable Face Retrieval via Cancelable Product Quantization [48.58859061524146]
  homomorphic encryption (HE) offers strong security guarantees by enabling arithmetic computations in the cipher space.<n>We propose Cancelable Product Quantization, a highly efficient framework for secure face representation retrieval.
  arXiv  Detail & Related papers  (2025-08-31T10:19:55Z)
• 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)
• DCT-CryptoNets: Scaling Private Inference in the Frequency Domain [8.084341432899954]
  This paper introduces DCT-CryptoNets, a novel approach that operates directly in the frequency-domain to reduce the burden of computationally expensive non-linear activations.<n>It does so by utilizing the discrete cosine transform (DCT), commonly employed in JPEG encoding, which has inherent compatibility with remote computing services.<n>It demonstrates inference on the ImageNet dataset within 2.5 hours (down from 12.5 hours on equivalent 96-thread compute resources)
  arXiv  Detail & Related papers  (2024-08-27T17:48:29Z)
• At Least Factor-of-Two Optimization for RWLE-Based Homomorphic Encryption [0.0]
  Homomorphic encryption (HE) supports certain operations on encrypted data without the need for decryption. HE schemes come with a non-trivial computational overhead that can hamper data-intensive workloads. We present an encryption method we call Zinc" which forgoes the multiple caching process, replacing it with a single scalar addition.
  arXiv  Detail & Related papers  (2024-08-14T05:42:35Z)
• Deep Learning and Chaos: A combined Approach To Image Encryption and Decryption [1.8749305679160366]
  We introduce a novel image encryption and decryption algorithm using hyperchaotic signals from the novel 3D hyperchaotic map, 2D memristor map, Convolutional Neural Network (CNN) The robustness of the encryption algorithm is shown by key sensitivity analysis, i.e., the average sensitivity of the algorithm to key elements.
  arXiv  Detail & Related papers  (2024-06-24T16:56:22Z)
• SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integers [50.608828039206365]
  We propose SOCI+ which significantly improves the performance of SOCI. SOCI+ employs a novel (2, 2)-threshold Paillier cryptosystem with fast encryption and decryption as its cryptographic primitive. Compared with SOCI, our experimental evaluation shows that SOCI+ is up to 5.4 times more efficient in computation and 40% less in communication overhead.
  arXiv  Detail & Related papers  (2023-09-27T05:19:32Z)
• Human-imperceptible, Machine-recognizable Images [76.01951148048603]
  A major conflict is exposed relating to software engineers between better developing AI systems and distancing from the sensitive training data. This paper proposes an efficient privacy-preserving learning paradigm, where images are encrypted to become human-imperceptible, machine-recognizable'' We show that the proposed paradigm can ensure the encrypted images have become human-imperceptible while preserving machine-recognizable information.
  arXiv  Detail & Related papers  (2023-06-06T13:41:37Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• THE-X: Privacy-Preserving Transformer Inference with Homomorphic Encryption [112.02441503951297]
  Privacy-preserving inference of transformer models is on the demand of cloud service users. We introduce $textitTHE-X$, an approximation approach for transformers, which enables privacy-preserving inference of pre-trained models.
  arXiv  Detail & Related papers  (2022-06-01T03:49:18Z)
• Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
  Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field. We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem. We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
  arXiv  Detail & Related papers  (2020-06-17T18:14:30Z)
• HERS: Homomorphically Encrypted Representation Search [56.87295029135185]
  We present a method to search for a probe (or query) image representation against a large gallery in the encrypted domain. Our encryption scheme is agnostic to how the fixed-length representation is obtained and can therefore be applied to any fixed-length representation in any application domain.
  arXiv  Detail & Related papers  (2020-03-27T01:10:54Z)

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.