Efficient Privacy-Preserving Sparse Matrix-Vector Multiplication Using Homomorphic Encryption

TL;DR

This paper introduces a novel framework combining homomorphic encryption with a new sparse matrix format, CSSC, to enable efficient privacy-preserving sparse matrix-vector multiplication, significantly improving computational speed and memory usage.

Contribution

It presents the first integrated approach for efficient privacy-preserving SpMV using HE and introduces CSSC, a new compressed sparse matrix format optimized for encrypted computations.

Findings

Achieves significant reductions in processing time.

Reduces memory usage compared to existing methods.

Demonstrates effectiveness on real-world datasets.

Abstract

Sparse matrix-vector multiplication (SpMV) is a fundamental operation in scientific computing, data analysis, and machine learning. When the data being processed are sensitive, preserving privacy becomes critical, and homomorphic encryption (HE) has emerged as a leading approach for addressing this challenge. Although HE enables privacy-preserving computation, its application to SpMV has remained largely unaddressed. To the best of our knowledge, this paper presents the first framework that efficiently integrates HE with SpMV, addressing the dual challenges of computational efficiency and data privacy. In particular, we introduce a novel compressed matrix format, named Compressed Sparse Sorted Column (CSSC), which is specifically designed to optimize encrypted sparse matrix computations. By preserving sparsity and enabling efficient ciphertext packing, CSSC significantly reduces storage and computational overhead. Our experimental results on real-world datasets demonstrate that the proposed method achieves significant gains in both processing time and memory usage. This study advances privacy-preserving SpMV and lays the groundwork for secure applications in federated learning, encrypted databases, scientific computing, and beyond.