Secure and efficient multiparty computation on genomic data
Source of Publication
ACM International Conference Proceeding Series
© ACM 2016. 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.
Al Aziz, Md Momin; Hasan, Mohammad Z.; Mohammed, Noman; and Alhadidi, Dima, "Secure and efficient multiparty computation on genomic data" (2016). Scopus Indexed Articles. 1508.