EP-HDC: Hyperdimensional Computing with Encrypted Parameters for High-Throughput Privacy-Preserving Inference
Not on the map. Why?
Abstract (arXiv)
While homomorphic encryption (HE) provides strong privacy protection, its high computational cost has restricted its application to simple tasks. Recently, hyperdimensional computing (HDC) applied to HE has shown promising performance for privacy-preserving machine learning (PPML). However, when applied to more realistic scenarios such as batch inference, the HDC-based HE has still very high compute time as well as high encryption and data transmission overheads. To address this problem, we propose HDC with encrypted parameters (EP-HDC), which is a novel PPML approach featuring client-side HE, i.e., inference is performed on a client using a homomorphically encrypted model. Our EP-HDC can effectively mitigate the encryption and data transmission overhead, as well as providing high scalability with many clients while providing strong protection for user data and model parameters. In addition to application examples for our client-side PPML, we also present design space exploration involving quantization, architecture, and HE-related parameters. Our experimental results using the BFV scheme and the Face/Emotion datasets demonstrate that our method can improve throughput and latency of batch inference by orders of magnitude over previous PPML methods (36.52~1068x and 6.45~733x, respectively) with less than 1% accuracy degradation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 31 references that are in the map. First posted on arXiv 1 Nov 2025.
Builds on
10 of 31 references.
References · 10
- 2019Learned Step Size Quantizationcited by 628
- 2018Gazelle: A Low Latency Framework for Secure Neural Network Inferencecited by 193
- 2018Low Latency Privacy Preserving Inferencecited by 57
- 2018Faster CryptoNets: Leveraging Sparsity for Real-World Encrypted Inferencecited by 45
- 2020A Theoretical Perspective on Hyperdimensional Computingcited by 43
- 2022ARK: Fully Homomorphic Encryption Accelerator with Runtime Data Generation and Inter-Operation Key Reusecited by 12
- 2020Prive-HD: Privacy-Preserved Hyperdimensional Computingcited by 7
- 2022FHEBench: Benchmarking Fully Homomorphic Encryption Schemescited by 2
- 2023Hyperdimensional Computing as a Rescue for Efficient Privacy-Preserving Machine Learning-as-a-Servicecited by 2
- 2023NTT-PIM: Row-Centric Architecture and Mapping for Efficient Number-Theoretic Transform on PIMcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024FastQuery: Communication-efficient Embedding Table Query for Private LLM Inference
- 2025Design and Optimization of Cloud Native Homomorphic Encryption Workflows for Privacy-Preserving ML Inference
- 2025CipherPrune: Efficient and Scalable Private Transformer Inference
- 2025Privacy-Preserving Inference for Quantized BERT Models
- 2024HEQuant: Marrying Homomorphic Encryption and Quantization for Communication-Efficient Private Inference
- 2025SoK: Can Fully Homomorphic Encryption Support General AI Computation? A Functional and Cost Analysis
- 2026HEAT: Faster Fully Homomorphic Inference via Approximations-Weights Co-Adaptation
- 2026Efficient Privacy-Preserving Retrieval Augmented Generation with Distance-Preserving Encryption