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

This paper introduces the first efficient framework for privacy-preserving sparse matrix-vector multiplication using homomorphic encryption, featuring a novel Compressed Sparse Sorted Column (CSSC) format that significantly reduces computational and storage overhead while enabling secure applications in fields like federated learning and scientific computing.

Yang Gao, Gang Quan, Wujie Wen, Scott Piersall, Qian Lou, Liqiang Wang

Published 2026-03-06
📖 4 min read☕ Coffee break read

Imagine you have a massive, incredibly detailed map of a city, but 99% of the streets on that map are empty (no roads, just open fields). This is what a Sparse Matrix is in the world of computers: a giant grid where almost everything is zero, and only a few spots have important numbers.

Now, imagine you need to do a math problem using this map and a list of numbers (a Vector). In the real world, you'd just ignore the empty fields and only do math on the roads that exist. This is called Sparse Matrix-Vector Multiplication (SpMV). It's fast and efficient.

The Problem: The "Secret" Map
But what if this map contains your private medical records or your bank account details? You can't just send the raw map to a cloud computer to do the math, because the cloud might peek and steal your secrets.

You need Homomorphic Encryption (HE). Think of this as putting your map and your list of numbers into a magic, unbreakable glass box. The cloud can shake the box, rotate it, and even do math inside the box, but it can never see what's inside. When it's done, it hands the box back, and you open it to find the answer.

The Old Way: The "Brute Force" Mistake
The problem is that existing methods for doing math inside these magic boxes were designed for dense maps (maps where every street is full of traffic).

  • If you try to use these old methods on your sparse map, the cloud computer has to do math on every single empty field (the zeros) just to be safe.
  • It's like trying to count the people in a stadium by asking every single empty seat, "Are you a person?" even though you know 99% of them are empty.
  • This makes the process incredibly slow and eats up all the memory, like trying to carry a suitcase full of air instead of just your clothes.

The New Solution: CSSC (The "Smart Organizer")
The authors of this paper invented a new way to organize the data before putting it in the magic box. They call it CSSC (Compressed Sparse Sorted Column).

Here is the analogy:
Imagine you have a messy pile of letters (the non-zero numbers) scattered across a giant floor.

  • Old Way: You put the whole floor, including all the empty space, into the magic box. The robot inside has to check every square inch.
  • CSSC Way: You first gather all the letters, sort them into neat, tight rows, and throw away all the empty floor space. You then stack these neat rows into small, manageable boxes.
    • Step 1: You sort the rows so the ones with the most letters are at the top.
    • Step 2: You push all the letters in each row to the left, so there are no gaps.
    • Step 3: You cut this organized stack into small, perfect chunks that fit perfectly into the magic box.

Why This is a Game Changer
Because the data is now perfectly organized:

  1. No Wasted Effort: The cloud robot inside the magic box only has to do math on the actual letters. It ignores the empty space completely.
  2. Perfect Packing: The "magic box" (the encryption) has a limited amount of space. CSSC packs the data so tightly that the box is full of useful information, not air.
  3. Speed: Because the robot doesn't have to check empty spots, it finishes the job 100 to 5,000 times faster than the old methods.
  4. Memory: It uses way less space, so you don't need a supercomputer to run it; a regular server can handle it.

The Result
The paper shows that with this new "Smart Organizer" (CSSC), we can finally do complex math on private, sensitive data (like medical records or financial data) in the cloud without slowing down the system or running out of memory.

In a Nutshell:

  • The Problem: Doing math on secret data is slow because old methods waste time on empty spaces.
  • The Fix: A new way to sort and pack the data (CSSC) so the secret math only happens on the important numbers.
  • The Benefit: Privacy is kept, but the speed is as fast as if the data wasn't secret at all.

It's like turning a chaotic, empty warehouse into a perfectly organized library, allowing a librarian to find a specific book instantly without having to walk through every empty aisle.