The Community for Technology Leaders
2012 IEEE 8th International Conference on E-Science (2012)
Chicago, IL, USA USA
Oct. 8, 2012 to Oct. 12, 2012
ISBN: 978-1-4673-4467-8
pp: 1-8
Henning Perl , Distributed Computing and Security Group, Leibniz University Hannover, Germany
Yassene Mohammed , Biomolecular Mass Spectrometry Unit, Department of Parasitology, Leiden University Medical Center, The Netherlands
Michael Brenner , Distributed Computing and Security Group, Leibniz University Hannover, Germany
Matthew Smith , Distributed Computing and Security Group, Leibniz University Hannover, Germany
ABSTRACT
Data protection is a challenge when outsourcing medical analysis, especially if one is dealing with patient related data. While securing transfer channels is possible using encryption mechanisms, protecting the data during analyses is difficult as it usually involves processing steps on the plain data. A common use case in bioinformatics is when a scientist searches for a biological sequence of amino acids or DNA nucleotides in a library or database of sequences to identify similarities. Most such search algorithms are optimized for speed with less or no consideration for data protection. Fast algorithms are especially necessary because of the immense search space represented for instance by the genome or proteome of complex organisms. We propose a new secure exact term search algorithm based on Bloom filters. Our algorithm retains data privacy by using Obfuscated Bloom filters while maintaining the performance needed for real-life applications. The results can then be further aggregated using Homomorphic Cryptography to allow exact-match searching. The proposed system facilitates outsourcing exact term search of sensitive data to on-demand resources in a way which conforms to best practice of data protection.
INDEX TERMS
Cryptography, Databases, Binary trees, Complexity theory, Vectors, Central Processing Unit, Outsourcing
CITATION

H. Perl, Y. Mohammed, M. Brenner and M. Smith, "Fast confidential search for bio-medical data using Bloom filters and Homomorphic Cryptography," 2012 IEEE 8th International Conference on E-Science(ESCIENCE), Chicago, IL, USA USA, 2012, pp. 1-8.
doi:10.1109/eScience.2012.6404484
94 ms
(Ver 3.3 (11022016))