arrow
Return

An Algorithm for Persistent Homology Computation Using Homomorphic Encryption

delete2025-10-01
delete0
PRE
AI
D
Dominic Gold
K
Koray Karabina
F
Francis C. Motta
DOI:10.1109/TDSC.2025.3616852delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Topological Data Analysis (TDA) provides a suite of tools that extract shape-based features from high-dimensional data, with applications to modern statistical and machine learning (ML) models. Among these tools, persistent homology (PH) summarizes the topological structure of data in compact representations known as persistence diagrams (PDs). Due to their robustness to noise, interpretability, and compatibility with standard ML architectures, PDs are increasingly used in applications involving sensitive data, such as genomics, cancer research, sensor networks, and finance. Thus, there is a growing need to incorporate TDA methods into secure, end-to-end data analysis pipelines. We present the first adaptation of a fundamental TDA algorithm known as boundary matrix reduction to operate on encrypted data using homomorphic encryption (HE). We provide mathematical guarantees for the correctness of the HE-compatible algorithm under appropriate parameter choices and analyze its computational complexity. We support these theoretical results with two distinct empirical studies: (1) a plaintext simulation that explores the extent to which the theoretically sufficient parameters can be relaxed while still preserving correctness, and (2) a working implementation in the OpenFHE framework that validates correctness on encrypted data. This work lays the foundation for fully encrypted topological computations and opens new directions in privacy-preserving data analysis using TDA.
Keywords:
Homomorphic encryption
topological data analysis
secure computing
persistent homology
applied cryptography
privacy enhancing technology

Journal

IEEE Transactions on Dependable and Secure Computing cover
IEEE Transactions on Dependable and Secure Computing
IF:
7.5
Papers:
2.5K
Citations:
9.6K

Organization

F
florida atlantic university
Scholars:
136
Papers: 77
Citations: 0
N
national research council of canada
Scholars:
219
Papers: 91
Citations: 0
Cited Papers

Cited Papers

Privately Evaluating Decision Trees and Random Forests
err2016-07-14
err0
errOAAI
errDavid J. Wu; Tony Feng; Michael Naehrig; Kristin Lauter
errShare
errSave
Numerical Method for Comparison on Homomorphically Encrypted Numbers
err2019-11-22
err0
PREAI
errJung Hee Cheon; Dongwoo Kim; Duhyeong Kim; Hun Hee Lee; Keewoo Lee
errShare
errSave
Homomorphic Encryption for Arithmetic of Approximate Numbers
err2017-11-30
err0
PREAI
errJung Hee Cheon; Andrey Kim; Miran Kim; Yongsoo Song
errShare
errSave
errShare
errSave
HE-Friendly Algorithm for Privacy-Preserving SVM Training
err2020-01-01
err27
errOAAI
errPark, Saerom; Byun, Junyoung; Lee, Joohee; Cheon, Jung Hee; Lee, Jaewook
errShare
errSave
Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network
err2022-01-01
err164
errOAAI
errLee, Joon-Woo; Kang, Hyungchul; Lee, Yongwoo; Choi, Woosuk; Eom, Jieun; Deryabin, Maxim; Lee, Eunsang; Lee, Junghyun; Yoo, Donghoon; Kim, Young-Sik; No, Jong-Seon
errShare
errSave
errShare
errSave
researcher View more