Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A multiparty homomorphic encryption approach to confidential federated Kaplan–Meier survival analysis

View through CrossRef
Abstract The proliferation of real-world health data enables multi-institutional survival studies, yet privacy constraints preclude centralizing sensitive records. We present a privacy-preserving federated Kaplan–Meier framework based on threshold CKKS (Cheon-Kim-Kim-Song) homomorphic encryption that supports approximate floating-point computation and encrypted aggregation of per-time-point counts while exposing only public outputs. Sites compute aligned at-risk and event tallies on a shared time grid and encrypt compact vectors; a coordinator aggregates ciphertexts; and a decryptor committee produces partial shares fused per block to recover aggregated plaintexts without releasing per-time-point tables. We prove correctness, stability, and slot-optimal vector packing, and derive scaling laws showing that communication grows linearly with the number of sites and predictably with the number of time points. Empirically, using synthetic breast-cancer data ( N  = 60,000) distributed across 500 sites, encrypted federated curves match the pooled oracle to numerical precision. In contrast, plaintext protocols permit trivial reconstruction by subtraction; our threshold-gated design precludes this attack under the stated threat model, enabling high-fidelity survival estimation with predictable overhead and substantially reduced privacy risk.
Title: A multiparty homomorphic encryption approach to confidential federated Kaplan–Meier survival analysis
Description:
Abstract The proliferation of real-world health data enables multi-institutional survival studies, yet privacy constraints preclude centralizing sensitive records.
We present a privacy-preserving federated Kaplan–Meier framework based on threshold CKKS (Cheon-Kim-Kim-Song) homomorphic encryption that supports approximate floating-point computation and encrypted aggregation of per-time-point counts while exposing only public outputs.
Sites compute aligned at-risk and event tallies on a shared time grid and encrypt compact vectors; a coordinator aggregates ciphertexts; and a decryptor committee produces partial shares fused per block to recover aggregated plaintexts without releasing per-time-point tables.
We prove correctness, stability, and slot-optimal vector packing, and derive scaling laws showing that communication grows linearly with the number of sites and predictably with the number of time points.
Empirically, using synthetic breast-cancer data ( N  = 60,000) distributed across 500 sites, encrypted federated curves match the pooled oracle to numerical precision.
In contrast, plaintext protocols permit trivial reconstruction by subtraction; our threshold-gated design precludes this attack under the stated threat model, enabling high-fidelity survival estimation with predictable overhead and substantially reduced privacy risk.

Related Results

A Multiparty Homomorphic Encryption Approach to Confidential Federated Kaplan–Meier Survival Analysis
A Multiparty Homomorphic Encryption Approach to Confidential Federated Kaplan–Meier Survival Analysis
Abstract The proliferation of real-world healthcare data has substantially expanded opportunities for collaborative research, yet stringent privacy regulations hind...
Development Paillier's library of fully homomorphic encryption
Development Paillier's library of fully homomorphic encryption
One of the new areas of cryptography considered-homomorphic cryptography. The article presents the main areas of application of homomorphic encryption. An analysis of existing deve...
Small Cell Lung Cancer and Tarlatamab: A Meta-Analysis of Clinical Trials
Small Cell Lung Cancer and Tarlatamab: A Meta-Analysis of Clinical Trials
Abstract Introduction Tarlatamab is a Delta-like ligand 3 (DLL3) -directed bispecific T-cell engager recently approved for use in patients with advanced small cell lung cancer (SCL...
Power of Homomorphic Encryption in Secure Data Processing
Power of Homomorphic Encryption in Secure Data Processing
Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. This paper presents a detailed discuss...
Homomorphic Encryption and its Application to Blockchain
Homomorphic Encryption and its Application to Blockchain
The concept, method, algorithm and application of the advanced field of cryptography, homomorphic encryption, as well as its application to the field of blockchain are discussed in...
Leveraging Searchable Encryption through Homomorphic Encryption: A Comprehensive Analysis
Leveraging Searchable Encryption through Homomorphic Encryption: A Comprehensive Analysis
The widespread adoption of cloud infrastructures has revolutionized data storage and access. However, it has also raised concerns regarding the privacy of sensitive data. To addres...

Back to Top