The DOI matches its Crossref record; 65 of the 68 references it cites were found in a registry or an index.
Large-Scale Privacy-Preserving Statistical Computations for Distributed Genome-Wide Association Studies
Open accessAbstract
We present privacy-preserving solutions for Genome-Wide Association Studies (GWAS) based on Secure Multi-Party Computation (SMPC). Using SMPC, we protect the privacy of patients when medical institutes collaborate for computing statistics on genomic data in a distributed fashion. Previous solutions for this task lack efficiency and/or use inadequate algorithms that are of limited practical value. Concretely, we optimize and implement multiple algorithms for the χ^2 $-, G-, and P-test in the ABY framework (Demmler et al., NDSS»15) and evaluate them in a distributed GWAS scenario. Statistical tests generally require advanced mathematical operations. For operations that cannot be calculated in integer arithmetic, we make use of the existing IEEE 754 floating point arithmetic implementation in ABY (Demmler et al., CCS»15). To improve performance, we extend the mixed-protocol capabilities of ABY by optimizing and implementing the integer to floating point conversion protocols of Aliasgari et al.\ (NDSS»13), which may be of independent interest. Furthermore, we consider extended contingency tables for the χ^2$- and G-test that use codeword counts instead of counts for only two alleles, thereby allowing for advanced, realistic analyses. Finally, we consider an outsourcing scenario where two non-colluding semi-trusted third parties process secret-shared input data from multiple institutes. Our extensive evaluation shows, compared to the prior art of Constable et al.\ (BMC Medical Informatics and Decision Making»15), an improved run-time efficiency of the χ^2 $-test by up to factor 37x. We additionally demonstrate practicality in scenarios with millions of participants and hundreds of collaborating institutes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The reliability/redundancy and scalability to more than a small number of parties is a concern for SMPC applications 77”
From Secure, privacy-preserving and federated machine learning in medical imaging (2020) · cites this paper as [77]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Statistical Methods for Research Workers
(1945) · American Journal of Clinical Pathology · doi:10.1093/ajcp/15.11.552b · Cited by 10,880
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×
“Other approaches use k -anonymity [58], l -diversity [18, 56], or differential privacy [42, 51] to securely perform GWAS on dis-tributeddatasets.”
MethodCalibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
How to generate and exchange secrets
Yao, A. C.-C. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 3,733 · cited 9×
“We evaluated the algorithms both with the GMW and Yao’s GC protocol (cf. § 2.4.4 and §2.4.5, respectively).”
MethodInfluentialL -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617 · cited 1×
“Other approaches use k-anonymity [58], l-diversity [18, 56], or differential privacy [42, 51] to securely perform GWAS on distributed datasets.”
BackgroundGoldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Homer, N., Szelinger, S., Redman, M., Duggan, D., Tembe, W., Muehling, J., Pearson, J. V., Stephan, D. A., Nelson, S. F., & Craig, D. W. (2008) · PLoS Genetics · doi:10.1371/journal.pgen.1000167 · Cited by 1,221 · cited 1×
“[27] introduced an attack showing that the participation of an individual in GWAS can be revealed from the aggregated data.”
BackgroundSomewhat Practical Fully Homomorphic Encryption.
Fan, J., & Vercauteren, F. (2012) · Cited by 1,189
How to Exchange Secrets with Oblivious TransferPreprint
Rabin, M. O. (1981) · IACR Cryptology ePrint Archive · Cited by 870
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T., & Zohner, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 827 · cited 6×
“As described in [17], MTs can be efficiently generated using OT extension [3].”
BackgroundMethodInfluentialSelf-citation
Research works printed but not linked: 3
- S. Kamara and M. Raykova . 2011. Secure outsourced computation in a multi-tenant cloud IBM Workshop on Cryptography and Security in Clouds. S. Kamara and M. Raykova . 2011. Secure outsourced computation in a multi-tenant cloud IBM Workshop on Cryptography and Security in Clouds.
- B. Kreuter A. Shelat B. Mood and K. Butler . 2013. PCF: a Portable Circuit Format for scalable two-party secure computation USENIX Security. B. Kreuter A. Shelat B. Mood and K. Butler . 2013. PCF: a Portable Circuit Format for scalable two-party secure computation USENIX Security.
- A. Weintraub . 2016. Inside Genomics Pioneer Craig Venter's Latest Production Technology Review. A. Weintraub . 2016. Inside Genomics Pioneer Craig Venter's Latest Production Technology Review.
Cited by
Secure, privacy-preserving and federated machine learning in medical imaging
Kaissis, G. A., Makowski, M. R., Rückert, D., & Braren, R. F. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0186-1 · Cited by 1,676
“The reliability/redundancy and scalability to more than a small number of parties is a concern for SMPC applications 77 , and computational considerations are a concern beyond small algorithm sizes, with efficient SMPC implementations of state-of-the-art neural network algorithms currently under…”
BackgroundPreserving privacy in speaker and speech characterisation
Nautsch, A., Jiménez, A., Treiber, A., Kolberg, J., Jasserand, C., Kindt, E. J., Delgado, H., Todisco, M., Hmani, M. A., Mtibaa, A., et al. (2019) · Computer Speech & Language · doi:10.1016/j.csl.2019.06.001 · Cited by 185
“In Thorne (2017), accuracy is pre-served using the Paillier cryptosystem: solely the mantissa is encrypted, whereas other terms remain in plaintext.”
MethodSelf-citationPILOT: Practical Privacy-Preserving Indoor Localization Using OuTsourcing
Jarvinen, K. U., Leppäkoski, H., Lohan, E. S., Richter, P., Schneider, T. H., Tkachenko, O., & Yang, Z. (2019) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp.2019.00040 · Cited by 68
Self-citationEPISODE: Efficient Privacy-PreservIng Similar Sequence Queries on Outsourced Genomic DatabasEs
Schneider, T. H., & Tkachenko, O. (2019) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3321705.3329800 · Cited by 45
“, outsourcing of genome data storing [41], pattern matching [43], genome sequence queries [17], and Genome-Wide Association Studies (GWAS) [10, 11, 15, 42], see [33] for a good survey on genomic privacy.”
BackgroundInfluentialSelf-citationSecure and Private Function Evaluation with Intel SGX
Felsen, S., Kiss, Á., Schneider, T. H., & Weinert, C. (2019) · Cloud Computing Security Workshop · doi:10.1145/3338466.3358919 · Cited by 27
Self-citation
Metadata
- Authors
- Tkachenko, O., Weinert, C., Schneider, T., & Hamacher, K.
- Affiliations
- Technische Universität Darmstadt (DE)
- Venue
- Proceedings of the 2018 on Asia Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2018-05-29
- Pages
- 221-235
- OpenAlex
- W2804382710
- Semantic Scholar
- f13212ac9050bf7832c9ebca99b2ebf8bc5ce945
- Cited by
- 27
- References
- 68
- Citations by year
- 2025: 3 · 2023: 1 · 2022: 7 · 2021: 4 · 2020: 6 · 2019: 5 · 2018: 1
- FWCI
- 1.63
- Type
- conference paper
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- ACM Asia Conference on Computer and Communications Security (ASIA CCS) (publishedVersion, cc-by-nc-sa)
- TUbilio (Technical University of Darmstadt) (submittedVersion)
- Funders
- Deutsche Forschungsgemeinschaft (CRC1119, project E4)
- Bundesministerium für Bildung und Forschung
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- genome-wide association study, privacy-preserving computation, secure multi-party computation, G-test, contingency tables, floating-point arithmetic, genomic data privacy
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Large-Scale Privacy-Preserving Statistical Computations for Distributed Genome-Wide Association Studies. https://app.cochat.ai/papers/10.1145/3196494.3196541
- The paper
- Tkachenko, O., Weinert, C., Schneider, T., & Hamacher, K. (2018). Large-Scale Privacy-Preserving Statistical Computations for Distributed Genome-Wide Association Studies. Proceedings of the 2018 on Asia Conference on Computer and Communications Security. https://doi.org/10.1145/3196494.3196541
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.