Abstract
With the rapid development of biotechnology, researchers are able to obtain large number of genome data sets. However, biological data often involves high privacy and data security issues. Thus when storing, transferring or analyzing these data, a safe and effective method is highly needed. This paper aims to propose a practical scheme using searchable homomorphic encryption. We combined the inverted index mechanism with the interactive operation on the homomorphic encrypted ciphertext data files, so as to realize the management and protection of biological data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Humbert, M., et al.: Addressing the concerns of the lacks family: quantification of kin genomic privacy. In: ACM SIGSAC Conference on Computer & Communications Security (2013)
Yaniv, E., Arvind, N.: Routes for breaching and protecting genetic privacy. Nat. Rev. Genet. 15(6), 409–421 (2014)
Naveed, M., et al.: Privacy in the Genomic Era. ACM Comput. Surv. 48(1), 1–44 (2015)
Melissa, G., et al.: Identifying personal genomes by surname inference. Science 339(6117), 321–324 (2013)
Malin, B., Sweeney, L.: How (not) to protect genomic data privacy in a distributed network: using trail re-identification to evaluate and design anonymity protection systems. J. Biomed. Inform. 37(3), 179–192 (2004)
Yasuda, M., et al.: Secure pattern matching using somewhat homomorphic encryption. In: ACM Workshop on Cloud Computing Security Workshop (2013)
Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: ACM Cloud Computing Security Workshop (2011)
Cheon, J.H., Kim, M., Lauter, K.: Homomorphic computation of edit distance. In: Brenner, M., Christin, N., Johnson, B., Rohloff, K. (eds.) FC 2015. LNCS, vol. 8976. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48051-9_15
Miran, K., Kristin, L.: Private genome analysis through homomorphic encryption. BMC Med. Inform. Decis. Mak. 15(Suppl 5), S3 (2015)
Rivest, R., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 26(2), 96–99 (1978)
Gentry, C.: A fully homomorphic encryption scheme (2009)
Gentry, C., Halevi, S., Smart, Nigel P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850–867. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32009-5_49
Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security & Privacy (2002)
Lu, W., Yamada, Y., Sakuma, J.: Efficient secure outsourcing of genome-wide association studies. In: Security & Privacy Workshops (2015)
Ayday, E., Raisaro, J.L., Hengartner, U., Molyneaux, A., Hubaux, J.P.: Privacy-preserving processing of raw genomic data. In: Garcia-Alfaro, J., Lioudakis, G., Cuppens-Boulahia, N., Foley, S., Fitzgerald, W. (eds.) DPM 2013, SETOP 2013. LNCS, vol. 8247. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54568-9_9
Riazi, M.S., et al.: GenMatch: secure DNA compatibility testing. In: IEEE International Symposium on Hardware Oriented Security & Trust (2016)
Simmons, S., Berger, B.: Realizing privacy preserving genome-wide association studies. Bioinformatics 32(9), 1293–1300 (2016)
Bing, W., et al.: Privacy-preserving pattern matching over encrypted genetic data in cloud computing. In: IEEE INFOCOM - IEEE Conference on Computer Communications (2017)
Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442–455. Springer, Heidelberg (2005). https://doi.org/10.1007/11496137_30
Curtmola, R., et al.: Searchable symmetric encryption: improved definitions and efficient constructions. In: ACM Conference on Computer & Communications Security (2006)
Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13190-5_1
Ning, C., et al.: Privacy-preserving multi-keyword ranked search over encrypted cloud data. In: INFOCOM. IEEE (2011)
Bing, W., et al.: Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud. In: INFOCOM. IEEE (2014)
Acknowledgments
The research of this article is supported by the national key research and development program “biological information security and efficient transmission” project, project No.2017YFC1201204.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Yang, M., Man, Y., Liu, N., Zhang, Y., Xing, X. (2019). Design of Searchable Algorithm for Biological Databased on Homomorphic Encryption. In: Milošević, D., Tang, Y., Zu, Q. (eds) Human Centered Computing. HCC 2019. Lecture Notes in Computer Science(), vol 11956. Springer, Cham. https://doi.org/10.1007/978-3-030-37429-7_54
Download citation
DOI: https://doi.org/10.1007/978-3-030-37429-7_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-37428-0
Online ISBN: 978-3-030-37429-7
eBook Packages: Computer ScienceComputer Science (R0)