Cargando…

BLOOM: BLoom filter based oblivious outsourced matchings

BACKGROUND: Whole genome sequencing has become fast, accurate, and cheap, paving the way towards the large-scale collection and processing of human genome data. Unfortunately, this dawning genome era does not only promise tremendous advances in biomedical research but also causes unprecedented priva...

Descripción completa

Detalles Bibliográficos
Autores principales: Ziegeldorf, Jan Henrik, Pennekamp, Jan, Hellmanns, David, Schwinger, Felix, Kunze, Ike, Henze, Martin, Hiller, Jens, Matzutt, Roman, Wehrle, Klaus
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5547447/
https://www.ncbi.nlm.nih.gov/pubmed/28786361
http://dx.doi.org/10.1186/s12920-017-0277-y
_version_ 1783255691492851712
author Ziegeldorf, Jan Henrik
Pennekamp, Jan
Hellmanns, David
Schwinger, Felix
Kunze, Ike
Henze, Martin
Hiller, Jens
Matzutt, Roman
Wehrle, Klaus
author_facet Ziegeldorf, Jan Henrik
Pennekamp, Jan
Hellmanns, David
Schwinger, Felix
Kunze, Ike
Henze, Martin
Hiller, Jens
Matzutt, Roman
Wehrle, Klaus
author_sort Ziegeldorf, Jan Henrik
collection PubMed
description BACKGROUND: Whole genome sequencing has become fast, accurate, and cheap, paving the way towards the large-scale collection and processing of human genome data. Unfortunately, this dawning genome era does not only promise tremendous advances in biomedical research but also causes unprecedented privacy risks for the many. Handling storage and processing of large genome datasets through cloud services greatly aggravates these concerns. Current research efforts thus investigate the use of strong cryptographic methods and protocols to implement privacy-preserving genomic computations. METHODS: We propose Fhe-Bloom and Phe-Bloom, two efficient approaches for genetic disease testing using homomorphically encrypted Bloom filters. Both approaches allow the data owner to securely outsource storage and computation to an untrusted cloud. Fhe-Bloom is fully secure in the semi-honest model while Phe-Bloom slightly relaxes security guarantees in a trade-off for highly improved performance. RESULTS: We implement and evaluate both approaches on a large dataset of up to 50 patient genomes each with up to 1000000 variations (single nucleotide polymorphisms). For both implementations, overheads scale linearly in the number of patients and variations, while Phe-Bloom is faster by at least three orders of magnitude. For example, testing disease susceptibility of 50 patients with 100000 variations requires only a total of 308.31 s (σ=8.73 s) with our first approach and a mere 0.07 s (σ=0.00 s) with the second. We additionally discuss security guarantees of both approaches and their limitations as well as possible extensions towards more complex query types, e.g., fuzzy or range queries. CONCLUSIONS: Both approaches handle practical problem sizes efficiently and are easily parallelized to scale with the elastic resources available in the cloud. The fully homomorphic scheme, Fhe-Bloom, realizes a comprehensive outsourcing to the cloud, while the partially homomorphic scheme, Phe-Bloom, trades a slight relaxation of security guarantees against performance improvements by at least three orders of magnitude.
format Online
Article
Text
id pubmed-5547447
institution National Center for Biotechnology Information
language English
publishDate 2017
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-55474472017-08-09 BLOOM: BLoom filter based oblivious outsourced matchings Ziegeldorf, Jan Henrik Pennekamp, Jan Hellmanns, David Schwinger, Felix Kunze, Ike Henze, Martin Hiller, Jens Matzutt, Roman Wehrle, Klaus BMC Med Genomics Research BACKGROUND: Whole genome sequencing has become fast, accurate, and cheap, paving the way towards the large-scale collection and processing of human genome data. Unfortunately, this dawning genome era does not only promise tremendous advances in biomedical research but also causes unprecedented privacy risks for the many. Handling storage and processing of large genome datasets through cloud services greatly aggravates these concerns. Current research efforts thus investigate the use of strong cryptographic methods and protocols to implement privacy-preserving genomic computations. METHODS: We propose Fhe-Bloom and Phe-Bloom, two efficient approaches for genetic disease testing using homomorphically encrypted Bloom filters. Both approaches allow the data owner to securely outsource storage and computation to an untrusted cloud. Fhe-Bloom is fully secure in the semi-honest model while Phe-Bloom slightly relaxes security guarantees in a trade-off for highly improved performance. RESULTS: We implement and evaluate both approaches on a large dataset of up to 50 patient genomes each with up to 1000000 variations (single nucleotide polymorphisms). For both implementations, overheads scale linearly in the number of patients and variations, while Phe-Bloom is faster by at least three orders of magnitude. For example, testing disease susceptibility of 50 patients with 100000 variations requires only a total of 308.31 s (σ=8.73 s) with our first approach and a mere 0.07 s (σ=0.00 s) with the second. We additionally discuss security guarantees of both approaches and their limitations as well as possible extensions towards more complex query types, e.g., fuzzy or range queries. CONCLUSIONS: Both approaches handle practical problem sizes efficiently and are easily parallelized to scale with the elastic resources available in the cloud. The fully homomorphic scheme, Fhe-Bloom, realizes a comprehensive outsourcing to the cloud, while the partially homomorphic scheme, Phe-Bloom, trades a slight relaxation of security guarantees against performance improvements by at least three orders of magnitude. BioMed Central 2017-07-26 /pmc/articles/PMC5547447/ /pubmed/28786361 http://dx.doi.org/10.1186/s12920-017-0277-y Text en © The Author(s) 2017 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
spellingShingle Research
Ziegeldorf, Jan Henrik
Pennekamp, Jan
Hellmanns, David
Schwinger, Felix
Kunze, Ike
Henze, Martin
Hiller, Jens
Matzutt, Roman
Wehrle, Klaus
BLOOM: BLoom filter based oblivious outsourced matchings
title BLOOM: BLoom filter based oblivious outsourced matchings
title_full BLOOM: BLoom filter based oblivious outsourced matchings
title_fullStr BLOOM: BLoom filter based oblivious outsourced matchings
title_full_unstemmed BLOOM: BLoom filter based oblivious outsourced matchings
title_short BLOOM: BLoom filter based oblivious outsourced matchings
title_sort bloom: bloom filter based oblivious outsourced matchings
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5547447/
https://www.ncbi.nlm.nih.gov/pubmed/28786361
http://dx.doi.org/10.1186/s12920-017-0277-y
work_keys_str_mv AT ziegeldorfjanhenrik bloombloomfilterbasedobliviousoutsourcedmatchings
AT pennekampjan bloombloomfilterbasedobliviousoutsourcedmatchings
AT hellmannsdavid bloombloomfilterbasedobliviousoutsourcedmatchings
AT schwingerfelix bloombloomfilterbasedobliviousoutsourcedmatchings
AT kunzeike bloombloomfilterbasedobliviousoutsourcedmatchings
AT henzemartin bloombloomfilterbasedobliviousoutsourcedmatchings
AT hillerjens bloombloomfilterbasedobliviousoutsourcedmatchings
AT matzuttroman bloombloomfilterbasedobliviousoutsourcedmatchings
AT wehrleklaus bloombloomfilterbasedobliviousoutsourcedmatchings