Transitive Pseudonyms Mediated EHRs Sharing for Very Important Patients

Zhu, Huafei; Ng, Wee-Keong

doi:10.1007/978-3-030-23499-7_6

Cited by 1 publication

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In their model, a trusted Beaver triple generator produces a, b, c ∈ Z * p such that c = ab mod p and then dispenses the shares ([a], [b] and [c]) of each value to the corresponding MPC servers. In [22], an interesting notion called multiplicatively homomorphic key management (mHKM) protocol is introduced and formalized in the context of multi-party computation, which in essence is an instance of general concept of transitive computing [23].…”

Section: The Techniquesmentioning

confidence: 99%

A Lightweight, Anonymous and Confidential Genomic Computing for Industrial Scale Deployment

Zhu

2021

Preprint

Self Cite

View full text Add to dashboard Cite

In Genomic era, researchers and biologists are exploring how human genes influence health, disease and biological pathways, and how the knowledge gained can contribute to better health through prediction disease risk, prevention and personalize therapies. Genome-Wide Association Study (GWAS) is a mechanism that involves rapidly scanning markers across the complete sets of DNA, or genomes, of human to discover the associations between complex human disease/traits and common genetic variants. The insightful analysis on GWAS demands aggregation of data from multiple genome research communities, or international collaborators. This paper studies anonymous and confidential genomic case and control computing within the federated framework leveraging SPDZ. Our contribution mainly comprises the following three-fold:-In the first fold, an efficient construction of Beaver triple generators (BTGs) formalized in the 3party computation leveraging multiplicatively homomorphic key management protocols (mHKMs) is presented and analysed. Interestingly, we are able to show the equivalence between BTGs and mHKMs. We then propose a lightweight construction of BTGs, and show that our construction is secure against semi-honest adversary if the underlying multiplicatively homomorphic encryption is semantically secure. -In the second fold, a decoupling model for SPDZ with explicit separation of BTGs from MPC servers (MPCs) is introduced and formalized, where BTGs aim to generate the Beaver triples while MPCs to process the input data. A new notion, which we call blind triple dispensation protocol, is then introduced for securely dispensing the generated Beaver triples, and constructed from mHKMs. We demonstrate the power of mHKMs by showing that it is a useful notion not only for generating Beaver triples but also for securely dispensing triples as well. -In the third-fold, a lightweight genomic case and control computing model is proposed, which reaches the anonymity and confidentiality simultaneously. An efficient truncation algorithm leveraging the depicted BTGs above is then proposed by eliminating computational cost heavy PRand-BitL() and PRandInt() protocols involved in the state-of-the-art solutions and thus largely benefits us computing residual vectors for industrial scale deployment.

show abstract

Section: The Techniquesmentioning

confidence: 99%