Cryptology ePrint Archive: Report 2017/207

Private Queries on Encrypted Genomic Data

Gizem S Cetin and Hao Chen and Kim Laine and Kristin Lauter and Peter Rindal and Yuhou Xia

Abstract: One of the tasks in the iDASH Secure Genome Analysis Competition in 2016 was to demonstrate the feasibility of privacy-preserving queries on homomorphically encrypted genomic data. More precisely, given a list of up to 100,000 mutations, the task was to encrypt the data using homomorphic encryption in a way that allows it to be stored securely in the cloud, and enables the data owner to query the dataset for the presence of specific mutations, without revealing any information about the dataset or the queries to the cloud. We devise a novel string matching protocol that works particularly nicely with homomorphically encrypted data, and show how it yields an efficient solution to the competition task. The protocol we describe is also of independent interest to the homomorphic encryption community, as it can be applied just as well to any kind of data.

Category / Keywords: cryptographic protocols / homomorphic encryption, genome privacy

Original Publication (in the same form): To appear in BMC Medical Genomics, 2017

Date: received 28 Feb 2017

Contact author: kim laine at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170301:001845 (All versions of this report)

Short URL: ia.cr/2017/207

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]