A Framework For The Iterative Solution of Sparse Linear Systems on Hybrid Architectures Using Homomorphic Encryption

This paper considers the solution of sparse linear systems via stationary iterative methods when the application of the preconditioner is implemented via plaintext matrix-ciphertext vector product using the Cheon-Kim-Kim-Song homomorphic encryption scheme. The proposed algorithm targets hybrid cloud architectures where the preconditioner application is performed on a non-secure environment and linear algebraic operations must be performed directly on encrypted data. We discuss several practical and theoretical details, and demonstrate that banded approximate inverses can be exploited to reduce the cost of homomorphic matrix-vector products. Numerical simulations demonstrate that the Richardson stationary iteration can compute an accurate solution even under the presence of homomorphic approximations.

Authors

Institutions

Publication Details

Published
2025-09-15
DOI
https://doi.org/10.1109/hpec67600.2025.11196237
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Framework For The Iterative Solution of Sparse Linear Systems on Hybrid Architectures Using Homomorphic Encryption

Barry Trager, Vassilis Kalantzis, Lior Horesh, Shashanka Ubaru
Cryptography and Data Security
article

A Framework For The Iterative Solution of Sparse Linear Systems on Hybrid Architectures Using Homomorphic Encryption

Barry Trager, Vassilis Kalantzis, Lior Horesh, Shashanka Ubaru
article en

Abstract

This paper considers the solution of sparse linear systems via stationary iterative methods when the application of the preconditioner is implemented via plaintext matrix-ciphertext vector product using the Cheon-Kim-Kim-Song homomorphic encryption scheme. The proposed algorithm targets hybrid cloud architectures where the preconditioner application is performed on a non-secure environment and linear algebraic operations must be performed directly on encrypted data. We discuss several practical and theoretical details, and demonstrate that banded approximate inverses can be exploited to reduce the cost of homomorphic matrix-vector products. Numerical simulations demonstrate that the Richardson stationary iteration can compute an accurate solution even under the presence of homomorphic approximations.

IBM Research - Thomas J. Watson Research Center (US)
Openalex Percentile: Top 85%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.