Skip to main content

Enabling Efficient and Fine-Grained DNA Similarity Search with Access Control over Encrypted Cloud Data

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10874))

Abstract

DNA similarity search has proven to be an essential demand in human genomic researches. Since DNA sequences contain many sensitive personal information, the acquisition and dissemination of DNA data have been tightly controlled and restricted by authorities. Although the problem of private DNA similarity query has been an active research issue, the latest research findings are still inadequate in terms of security, functionality and efficiency. In this paper, we propose an Efficient DNA Similarity Search scheme (EDSS) which can achieve fine-grained query and data access control over encrypted cloud data. Our original contributions are fourfold. First, we creatively put forward a private edit distance approximation algorithm to realize the efficient and high accurate DNA similarity query. Second, we classify the whole DNA sequences and design a multiple genes search strategy to achieve complicated logic query such as mixed “AND” and “NO” operations on genes. Third, the proposed scheme can also efficiently support data access control by employing a novel polynomial based design. Finally, security analysis and extensive experiments demonstrate the high security and efficiency of EDSS compared with existing schemes.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    https://cloud.google.com/genomics/.

References

  1. Ebadollahi, S., Sun, J., Gotz, D., Hu, J., Sow, D., Neti, C.: Predicting patient’s trajectory of physiological data using temporal trends in similar patients: a system for near-term prognostics. In: proceedings of AMIA Annual Symposium, pp. 192–196 (2010)

    Google Scholar 

  2. Asharov, G., Halevi, S., Lindell, Y., Rabin, T.: Privacy-preserving search of similar patients in genomic data. IACR Cryptology ePrint Archive, pp. 1–27 (2017)

    Google Scholar 

  3. Wang, X.S., Huang, Y., Zhao, Y., Tang, H., Wang, X., Bu, D.: Efficient genome-wide, privacy-preserving similar patient query based on private edit distance. In: Proceedings of ACM CCS, pp. 492–503 (2015)

    Google Scholar 

  4. Wang, B., Song, W., Lou, W., Hou, Y.T.: Privacy-preserving pattern matching over encrypted genetic data in cloud computing. In: Proceedings of IEEE INFOCOM, pp. 1–9 (2017)

    Google Scholar 

  5. Watson, M.: Illuminating the future of DNA sequencing. Genome Biol. 15(2), 108–110 (2014)

    Article  Google Scholar 

  6. Wang, R., Wang, X.F., Li, Z., Tang, H., Reiter, M.K., Dong, Z.: Privacy-preserving genomic computation through program specialization. In: Proceedings of ACM CCS, pp. 338–347 (2009)

    Google Scholar 

  7. Hamalainen, P., Alho, T., Hannikainen, M., Hamalainen, T.D.: Design and implementation of low-area and low-power AES encryption hardware core. In: EUROMICRO Conference on Digital System Design, pp. 577–583 (2006)

    Google Scholar 

  8. Li, H., Liu, D., Dai, Y., Luan, T.H., Shen, X.: Enabling efficient multi-keyword ranked search over encrypted cloud data through blind storage. IEEE Trans. Emerg. Top. Comput. 3(1), 127–138 (2015)

    Article  Google Scholar 

  9. Li, H., Yang, Y., Luan, T.H., Liang, X., Zhou, L., Shen, X.S.: Enabling fine-grained multi-keyword search supporting classified sub-dictionaries over encrypted cloud data. IEEE Trans. Dependable Secure Comput. 13(3), 312–325 (2016)

    Article  Google Scholar 

  10. Li, H., Lin, X., Yang, H., Liang, X., Lu, R., Shen, X.: EPPDR: an efficient privacy-preserving demand response scheme with adaptive key evolution in smart grid. IEEE Trans. Parallel Distrib. Syst. 25(8), 2053–2064 (2014)

    Article  Google Scholar 

  11. Xu, G., Li, H., Tan, C., Liu, D., Dai, Y., Yang, K.: Achieving efficient and privacy-preserving truth discovery in crowd sensing systems. Comput. Secur. 69, 114–126 (2017)

    Article  Google Scholar 

  12. Wong, W.K., Cheung, D.W.l., Kao, B., Mamoulis, N.: Secure kNN computation on encrypted databases. In: Proceedings of ACM SIGMOD, pp. 139–152 (2009)

    Google Scholar 

  13. GenBank Database (2017). https://www.ncbi.nlm.nih.gov/genbank/

Download references

Acknowledgment

This work is supported by the National Key R&D Program of China under Grants 2017YFB0802300 and 2017YFB0802000, the National Natural Science Foundation of China under Grants 61772121, 61728102, and 61472065, the Fundamental Research Funds for Chinese Central Universities under Grant ZYGX2015J056.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongwei Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, H., Xu, G., Tang, Q., Lin, X., Shen, X.(. (2018). Enabling Efficient and Fine-Grained DNA Similarity Search with Access Control over Encrypted Cloud Data. In: Chellappan, S., Cheng, W., Li, W. (eds) Wireless Algorithms, Systems, and Applications. WASA 2018. Lecture Notes in Computer Science(), vol 10874. Springer, Cham. https://doi.org/10.1007/978-3-319-94268-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94268-1_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94267-4

  • Online ISBN: 978-3-319-94268-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics