Secure and efficient multiparty computation on genomic data

Document Type

Conference Proceeding

Source of Publication

ACM International Conference Proceeding Series

Publication Date

7-11-2016

Abstract

© 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.

ISBN

9781450341189

Publisher

Association for Computing Machinery

Volume

11-13-July-2016

First Page

278

Last Page

283

Disciplines

Computer Sciences | Mathematics | Medicine and Health Sciences

Keywords

Genomic data security, Homomorphic encryption, Secure genomic computation, Secure multiparty computation

Scopus ID

84989227628

Indexed in Scopus

yes

Open Access

no

Link to Full Text

Share

COinS