Efficient privacy-preserving string search and an application in genomics.

ABSTRACT:

Motivation

Personal genomes carry inherent privacy risks and protecting privacy poses major social and technological challenges. We consider the case where a user searches for genetic information (e.g. an allele) on a server that stores a large genomic database and aims to receive allele-associated information. The user would like to keep the query and result private and the server the database.

Approach

We propose a novel approach that combines efficient string data structures such as the Burrows-Wheeler transform with cryptographic techniques based on additive homomorphic encryption. We assume that the sequence data is searchable in efficient iterative query operations over a large indexed dictionary, for instance, from large genome collections and employing the (positiona

SUBMITTER: Shimizu K 

PROVIDER: S-EPMC4892414 | biostudies-literature | 2016 Jun

REPOSITORIES: biostudies-literature