A Multiparty Homomorphic Encryption Approach to Confidential Federated Kaplan Meier Survival Analysis
Narasimha Raghavan Veeraragavan, Svetlana Boudko, Jan Franz Nyg{\aa}rd

TL;DR
This paper introduces a privacy-preserving federated Kaplan-Meier survival analysis framework using homomorphic encryption, enabling multi-institutional studies without exposing sensitive data.
Contribution
It develops a novel threshold CKKS-based homomorphic encryption method for secure, approximate, multi-party survival analysis with provable correctness and predictable communication costs.
Findings
Encrypted federated curves match pooled oracle results.
Plaintext protocols are vulnerable to trivial data reconstruction.
The approach scales linearly with the number of sites and time points.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
