Large-Scale Privacy-Preserving Statistical Computations for Distributed Genome-Wide Association Studies
Open accessThe DOI matches its Crossref record; 65 of the 68 references it cites were found in a registry or an index.
Abstract
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
Somewhat Practical Fully Homomorphic Encryption.Preprint
Fan, J., & Vercauteren, F. (2012) · IACR Cryptology ePrint Archive · Cited by 2,597
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.”
BackgroundHow 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-citationExtending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746 · cited 1×
“OT extension protocols [3, 7, 28] allow to efficiently generate a large amount of OTs from a small amount of base OTs that require costly public-key cryptography.”
BackgroundImproved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743 · cited 1×
“In Yao’s GC protocol the evaluation of XOR gates is “free” [37], wheres the evaluation of AND gates requires transmitting and decrypting ciphertexts as part of the garbled circuit.”
MethodSelf-citationSharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
Spencer, C. C. A., Su, Z., Donnelly, P., & Marchini, J. (2009) · PLoS Genetics · doi:10.1371/journal.pgen.1000477 · Cited by 605 · cited 1×
“After aggregation from different sources, a sufficient amount of data for conducting statistical tests might be available [55].”
BackgroundMASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
Keller, M., Orsini, E., & Scholl, P. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978357 · Cited by 411
More efficient oblivious transfer and extensions for faster secure computation
Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516738 · Cited by 358 · cited 2×
“OT extension protocols [3, 7, 28] allow to efficiently generate a large amount of OTs from a small amount of base OTs that require costly public-key cryptography.”
BackgroundSelf-citationTASTY: tool for automating secure two-party computations
Henecka, W., K ögl, S., Sadeghi, A.-R., Schneider, T., & Wehrenberg, I. (2010) · Proceedings of the 17th ACM conference on Computer and communications security · doi:10.1145/1866307.1866358 · Cited by 356
Self-citationSteinsbekk, K. S., Kåre Myskja, B., & Solberg, B. (2013) · European Journal of Human Genetics · doi:10.1038/ejhg.2012.282 · Cited by 320 · cited 1×
“Nonetheless, some contractual obligations currently forbid institutes to perform these distributed analyses as they are a clear violation of the data owner’s privacy; or data centers require so-called “broad consent” — basically full authorization to do whatever a data holder wants — that ultimately reduces the number…”
BackgroundAminkeng, F., Bhavsar, A. P., Visscher, H., Rassekh, S. R., Li, Y., Lee, J. W., Brunham, L. R., Caron, H. N., van Dalen, E. C., Kremer, L. C., et al. (2015) · Nature Genetics · doi:10.1038/ng.3374 · Cited by 278 · cited 1×
“As part of future work we envision implementing further statistical tests (e.g., Student’s t-test [48] or Fisher’s exact text [2]) and investigating floating-point-like number representations that might be better suited for secure statistical computations (e.g., [22]).”
MethodCorrelated pseudorandomness and the complexity of private computations
Beaver, D. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237996 · Cited by 233 · cited 1×
“OT extension protocols [3, 7, 28] allow to efficiently generate a large amount of OTs from a small amount of base OTs that require costly public-key cryptography.”
BackgroundWang, R., Li, Y. F., Wang, X., Tang, H., & Zhou, X. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653726 · Cited by 211
A generalization of Paillier’s public-key system with applications to electronic voting
Damgård, I., Jurik, M., & Nielsen, J. B. (2010) · International Journal of Information Security · doi:10.1007/s10207-010-0119-9 · Cited by 208 · cited 1×
“Another recent solution [52] also employs SGX: here, data owners send their genotype counts Paillier-encrypted [15] to a central server which uses the homomorphic property to sum the inputs before performing statistical computations inside a secure enclave.”
MethodIdentifying Participants in the Personal Genome Project by Name
Sweeney, L., Abu, A., & Winn, J. (2013) · SSRN Electronic Journal · doi:10.2139/ssrn.2257732 · Cited by 189
Privacy-preserving data exploration in genome-wide association studies
Johnson, A., & Shmatikov, V. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487687 · Cited by 173 · cited 1×
“Many solutions were proposed in recent years that apply differential privacy , e.g., [20, 29, 30, 51, 54, 60, 65, 66, 70].”
BackgroundPrivate collaborative forecasting and benchmarking
Atallah, M. J., Bykova, M., Li, J., Frikken, K. B., & Topkara, M. (2004) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1029179.1029204 · Cited by 171 · cited 1×
“Arithmetic sharing denotes the additive sharing of an l -bit value x as the sum of two integers in the ring Z 2 l [4, 34].”
BackgroundScalable privacy-preserving data sharing methodology for genome-wide association studies
Yu, F., Fienberg, S. E., Slavković, A. B., & Uhler, C. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.01.008 · Cited by 137 · cited 1×
“Many solutions were proposed in recent years that apply differential privacy , e.g., [20, 29, 30, 51, 54, 60, 65, 66, 70].”
BackgroundPrivate genome analysis through homomorphic encryption
Kim, M., & Lauter, K. (2015) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-15-s5-s3 · Cited by 136 · cited 1×
“Kim et al. [36] apply different fully homomorphic encryption schemes to compute the χ 2 -test.”
MethodA new way to protect privacy in large-scale genome-wide association studies
Kamm, L., Bogdanov, D., Laur, S., & Vilo, J. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt066 · Cited by 125 · cited 1×
“In [32], Kamm et al. propose that all institutes enter their whole collected genomic data into a storage system running a 3-out-of-3 additive sharing algorithm.”
BackgroundPrivacy-Preserving Data Sharing for Genome-Wide Association Studies
Uhler, C., Slavkovic, A. B., & Fienberg, S. E. (2013) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v5i1.629 · Cited by 124
Quillen, E. E., Chen, X., Almasy, L., Yang, F., He, H., Li, X., Wang, X., Liu, T., Hao, W., Deng, H., et al. (2014) · American Journal of Medical Genetics Part B: Neuropsychiatric Genetics · doi:10.1002/ajmg.b.32213 · Cited by 112
GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits
Schneider, T. H., & Zohner, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39884-1_23 · Cited by 112 · cited 1×
“In [53], the authors find that in low latency / local networks GMW generally outperforms Yao, whereas in high latency / wide-area networks the constant round property might give Yao an advantage, depending on the function to be evaluated.”
BackgroundSelf-citationGuidelines for Genome-Wide Association Studies
Barsh, G. S., Copenhaver, G. P., Gibson, G., & Williams, S. M. (2012) · PLoS Genetics · doi:10.1371/journal.pgen.1002812 · Cited by 110 · cited 1×
“05 is considered to be a good practice in statistics [21], but in GWAS much smaller values are used, e.g., α = 5 · 10 − 8 [6], mainly due to so-called multiple-testing correction(s).”
BackgroundA Glossary of Genetics and Cytogenetics: Classical and Molecular
Rieger, R., Michaelis, A., & Green, M. M. (1968) · Medical Entomology and Zoology · Cited by 103
Secure Computation on Floating Point Numbers.
Aliasgari, M., Blanton, M., Zhang, Y., & Steele, A. (2012) · Cited by 98
Privacy Preserving GWAS Data Sharing
Fienberg, S. E., Slavkovic, A., & Uhler, C. (2011) · 2011 IEEE 11th International Conference on Data Mining Workshops · doi:10.1109/icdmw.2011.140 · Cited by 96 · cited 1×
“Many solutions were proposed in recent years that apply differential privacy , e.g., [20, 29, 30, 51, 54, 60, 65, 66, 70].”
BackgroundAn Adaptive Association Test for Multiple Phenotypes with GWAS Summary Statistics
Kim, J., Bai, Y. Z., & Pan, W. (2015) · Genetic Epidemiology · doi:10.1002/gepi.21931 · Cited by 93 · cited 1×
“One possible application is investigating the associations between diseases and specific parts of the genome, which is increasingly used in epidemiology [35].”
BackgroundSecure Multiparty Computation from SGX
Bahmani, R., Barbosa, M., Brasser, F., Portela, B., Sadeghi, A., Scerri, G., & Warinschi, B. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70972-7_27 · Cited by 89 · cited 1×
“The authors of [12] propose to compute several GWAS statistics in a secure enclave using Intel Software Guard Extensions (SGX) [5].”
MethodZhang, Y., Steele, A., & Blanton, M. (2013) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2508859.2516752 · Cited by 86
Automated Synthesis of Optimized Circuits for Secure Computation
Demmler, D., Dessouky, G., Koushanfar, F., Sadeghi, A.-R., Schneider, T., & Zeitouni, S. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813678 · Cited by 83 · cited 4×
“They were implemented in the SMPC frameworks Sharemind [8], PICCO [69], and ABY [16].”
BackgroundMethodInfluentialSelf-citationTo Release or Not to Release: Evaluating Information Leaks in Aggregate Human-Genome Data
Zhou, X., Peng, B., Li, Y. F., Chen, Y., Tang, H., & Wang, X. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23822-2_33 · Cited by 82 · cited 1×
“After that,manyattackswereproposedtodeanonymizeindividualsin distributedGWAS,e.g.,[62,71].”
Privacy-Preserving Outsourced Calculation on Floating Point Numbers
Liu, X., Deng, R. H., Ding, W., Lu, R., & Qin, B. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2585121 · Cited by 75 · cited 1×
“Multiple algorithms were proposed for computing floating point arithmetic in SMPC [1, 16, 26, 39, 47, 69] and in homomorphic encryption [22, 40].”
MethodLu, W.-J., Yamada, Y., & Sakuma, J. (2015) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-15-s5-s1 · Cited by 70 · cited 1×
“In [41], Lu et al. also perform GWAS in the cloud.”
BackgroundA community assessment of privacy preserving techniques for human genomes
Jiang, X., Zhao, Y., Wang, X., Malin, B., Wang, S., Ohno-Machado, L., & Tang, H. (2014) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-14-s1-s1 · Cited by 63 · cited 1×
“Many solutions were proposed in recent years that apply differential privacy , e.g., [20, 29, 30, 51, 54, 60, 65, 66, 70].”
BackgroundAutomatic Protocol Selection in Secure Two-Party Computations
Kerschbaum, F., Schneider, T. H., & Schröpfer, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-07536-5_33 · Cited by 62 · cited 1×
“Arithmetic sharing denotes the additive sharing of an l -bit value x as the sum of two integers in the ring Z 2 l [4, 34].”
BackgroundSelf-citationFORESEE: Fully Outsourced secuRe gEnome Study basEd on homomorphic Encryption
Zhang, Y., Dai, W., Jiang, X., Xiong, H., & Wang, S. (2015) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-15-s5-s5 · Cited by 61 · cited 1×
“[68] proposed the FORESEE framework to fully outsource GWAS to the cloud.”
BackgroundRealizing privacy preserving genome-wide association studies
Simmons, S., & Berger, B. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw009 · Cited by 59 · cited 1×
“Many solutions were proposed in recent years that apply differential privacy , e.g., [20, 29, 30, 51, 54, 60, 65, 66, 70].”
BackgroundPullonen, P., & Siim, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48051-9_13 · Cited by 59 · cited 1×
“Multiple algorithms were proposed for computing floating point arithmetic in SMPC [1, 16, 26, 39, 47, 69] and in homomorphic encryption [22, 40].”
MethodPrivacy-preserving GWAS analysis on federated genomic datasets
Constable, S. D., Tang, Y., Wang, S., Jiang, X., & Chapin, S. (2015) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-15-s5-s2 · Cited by 57 · cited 10×
“• Extensive performance evaluation showing a run-time improvement of factor 37x over previous art [14] and demonstrating practicality in scenarios with millions of participants and hundreds of collaborating institutes.”
BackgroundMethodResultInfluentialYu, F., & Ji, Z. (2014) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-14-s1-s3 · Cited by 49 · cited 1×
“Many solutions were proposed in recent years that apply differential privacy , e.g., [20, 29, 30, 51, 54, 60, 65, 66, 70].”
BackgroundDesign alternatives for barrel shifters
Pillmeier, M. R., Schulte, M., & Walters, E. G. (2002) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.452034 · Cited by 47 · cited 1×
“Since there is no bit-shifter in the standard functionality of the ABY framework, we implement the barrel shifter introduced in [46].”
MethodSecure distributed genome analysis for GWAS and sequence comparison computation
Zhang, Y., Blanton, M., & Almashaqbeh, G. (2015) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-15-s5-s4 · Cited by 41 · cited 1×
“[67] propose a solution using Shamir’s secret sharing scheme with a (n, t)-threshold configured s.”
MethodDeterministic identification of specific individuals from GWAS results
Cai, R., Hao, Z., Winslett, M., Xiao, X., Yang, Y., Zhang, Z., & Zhou, S. (2015) · Bioinformatics · doi:10.1093/bioinformatics/btv018 · Cited by 37 · cited 1×
“Whiletheearlierattacksrequired extremelylargedatabasesforde-anonymization,finallyapractical attackwasconstructedin[11].”
Secure computations on non-integer values
Franz, M., Deiseroth, B., Hamacher, K., Jha, S., Katzenbeisser, S., & Schröder, H. (2010) · IEEE International Workshop on Information Forensics and Security · doi:10.1109/wifs.2010.5711458 · Cited by 29 · cited 1×
“Multiple algorithms were proposed for computing floating point arithmetic in SMPC [1, 16, 26, 39, 47, 69] and in homomorphic encryption [22, 40].”
MethodSelf-citationPREMIX: PRivacy-preserving EstiMation of Individual admiXture.
Chen, F., Dow, M. T., Ding, S., Lu, Y., Jiang, X., Tang, H., & Wang, S. (2016) · PubMed · Cited by 25
Tight bounds for the multiplicative complexity of symmetric functions
Boyar, J., & Peralta, R. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.01.030 · Cited by 25 · cited 1×
“For counting the one-bits (aka calculating the Hamming weight), we use the size-optimal circuit of [10].”
MethodZhao, Y., Wang, X., Jiang, X., Lucila Ohno-machado, A., & Tang, H. (2014) · Journal of the American Medical Informatics Association · doi:10.1136/amiajnl-2014-003043 · Cited by 25 · cited 1×
“Many solutions were proposed in recent years that apply differential privacy , e.g., [20, 29, 30, 51, 54, 60, 65, 66, 70].”
BackgroundHybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations
Krips, T., & Willemson, J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13257-0_11 · Cited by 25 · cited 10×
“9 to those reported for the SMPC solution in the very recent work [9].”
MethodInfluentialChiesa, M., Demmler, D., Canini, M., Schapira, M., & Schneider, T. H. (2017) · ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) · doi:10.1145/3143361.3143362 · Cited by 25 · cited 1×
“For this purpose we use the special shared input and output gates in ABY that were first introduced in [13].”
MethodSelf-citationIdentifying inference attacks against healthcare data repositories.
Vaidya, J. S., Shafiq, B., Jiang, X., & Lucila Ohno-machado, A. (2013) · PubMed Central · Cited by 23
Sadat, M. N., Aziz, M. A., Mohammed, N., Chen, F., Wang, S., & Jiang, X. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.02577 · Cited by 21 · cited 1×
“Another recent solution [52] also employs SGX: here, data owners send their genotype counts Paillier-encrypted [15] to a central server which uses the homomorphic property to sum the inputs before performing statistical computations inside a secure enclave.”
MethodA New Class of Private Chi-Square Hypothesis Tests.
Rogers, R., & Kifer, D. (2017) · International Conference on Artificial Intelligence and Statistics · Cited by 21
Privacy and Security in the Genomic Era
Ayday, E., & Hubaux, J. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2976751 · Cited by 18
Moral science and the Presidential Commission for the Study of Bioethical Issues
Gutmann, A., & Wagner, J. W. (2011) · The Lancet · doi:10.1016/s0140-6736(11)61884-9 · Cited by 9
Correcting Finite Sampling Issues in Entropy l-diversity
Stammler, S., Katzenbeisser, S., & Hamacher, K. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45381-1_11 · Cited by 9 · cited 1×
“Other approaches use k -anonymity [58], l -diversity [18, 56], or differential privacy [42, 51] to securely perform GWAS on dis-tributeddatasets.”
MethodSelf-citationPrivacy-Preserving Genome-Wide Association Study is Practical.Preprint
Bonte, C., Makri, E., Ardeshirdavani, A., Simm, J., Moreau, Y., & Vercauteren, F. (2017) · IACR Cryptology ePrint Archive · Cited by 6
Research works printed but not linked: 3
- 31. S. Kamara and M. Raykova. 2011. Secure outsourced computation in a multi- tenant cloud. In IBM Workshop on Cryptography and Security in Clouds.
- 38. B. Kreuter, A. Shelat, B. Mood, and K. Butler. 2013. PCF: a Portable Circuit Format for scalable two-party secure computation. In USENIX Security.
- 63. A. Weintraub. 2016. Inside Genomics Pioneer Craig Venter's Latest Production. In 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 191
“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 39
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
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.