Visible to the public Secure and Efficient Multiparty Computation on Genomic Data

TitleSecure and Efficient Multiparty Computation on Genomic Data
Publication TypeConference Paper
Year of Publication2016
AuthorsAl Aziz, Md Momin, Hasan, Mohammad Z., Mohammed, Noman, Alhadidi, Dima
Conference NameProceedings of the 20th International Database Engineering & Applications Symposium
PublisherACM
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-4118-9
Keywordscomposability, efficient encryption, Genomic data security, homomorphic encryption, pubcrawl, Resiliency, secure genomic computation, secure multiparty computation
Abstract

Large scale biomedical research projects involve analysis of huge amount of genomic data which is owned by different data owners. The collection and storing of genomic data is sometimes beyond the capability of a sole organization. Genomic data sharing is a feasible solution to overcome this problem. These scenarios can be generalized into the problem of aggregating data distributed among multiple databases and owned by different data owners. However, we should guarantee that an adversary cannot learn anything about the data or the individual contribution of each party towards the final output of the computation. In this paper, we propose a practical solution for secure sharing and computation of genomic data. We adopt the Paillier cryptosystem and the order preserving encryption to securely execute the count query and the ranked query. Experimental results demonstrate that the computation time is realistic enough to make our system adoptable in the real world.

URLhttp://doi.acm.org/10.1145/2938503.2938507
DOI10.1145/2938503.2938507
Citation Keyal_aziz_secure_2016