Skip to main content

Binary Binomial Tree Based Secure and Efficient Electronic Healthcare Record Storage in Cloud Environment

  • Conference paper
  • First Online:
Innovations for Community Services (I4CS 2020)

Abstract

Electronic Health Records (EHRs) is a key form of healthcare records that attracts a great deal of attention. It is regarded that the sharing of healthcare records is a vital strategy for improving the quality of healthcare services and reducing medical expenses. Presently, the cloud computing paradigm supports many significant characteristics in Electronics Health Records (EHRs). However, in the cloud model, the patients have no longer control over their crucial healthcare records after outsourcing the records to cloud servers, which can lead to severe data integrity related concerns. Therefore, in this manuscript, we introduce a novel secure and efficient cloud based EHR data storage system by constructing Binary Binomial Tree like data structure. Furthermore, we extend the proposed model to attain significant cloud model based public auditing characteristics such as data dynamics, batch auditing, privacy preserving, blockless verification, data traceability, and recoverability. Extensive experiments and results demonstrate that the proposed cloud based EHR system is secure and efficient over other existing strategies.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Similar content being viewed by others

References

  1. Xia, Q.I., Sifah, E.B., Asamoah, K.O., Gao, J., Du, X., Guizani, M.: MeDShare: trust-less medical data sharing among cloud service providers via blockchain. IEEE Access 5, 14757–14767 (2017)

    Article  Google Scholar 

  2. Joshi, M., Joshi, K.P., Finin, T.: Delegated authorization framework for EHR services using attribute based encryption. IEEE Trans. Serv. Comput. (2019). https://doi.org/10.1109/TSC.2019.2917438

  3. Wang, H., Song, Y.: Secure cloud-based EHR system using attribute-based cryptosystem and blockchain. J. Med. Syst. 42(8), 152 (2018)

    Article  MathSciNet  Google Scholar 

  4. Ying, Z., Wei, L., Li, Q., Liu, X., Cui, J.: A lightweight policy preserving EHR sharing scheme in the cloud. IEEE Access 6, 53698–53708 (2018)

    Article  Google Scholar 

  5. Li, A., Tan, S., Jia, Y.: A method for achieving provable data integrity in cloud computing. J. Supercomput. 75(1), 92–108 (2019)

    Article  Google Scholar 

  6. Qureshi, B., Koubaa, A., Al Mhaini, M.: A lightweight and secure framework for hybrid cloud based EHR systems. In: Mehmood, R., Bhaduri, B., Katib, I., Chlamtac, I. (eds.) SCITA 2017. LNICST, vol. 224, pp. 197–206. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94180-6_20

    Chapter  Google Scholar 

  7. Nayak, S.K., Tripathy, S.: Privacy preserving provable data possession for cloud based electronic health record system. In: 2016 IEEE Trustcom/BigDataSE/ISPA, pp. 860–867. IEEE, August 2016

    Google Scholar 

  8. Cai, Z., Yan, H., Li, P., Huang, Z.A., Gao, C.: Towards secure and flexible EHR sharing in mobile health cloud under static assumptions. Cluster Comput. 20(3), 2415–2422 (2017)

    Article  Google Scholar 

  9. Deshmukh, P.: Design of cloud security in the EHR for Indian healthcare services. J. King Saud Univ.-Comput. Inf. Sci. 29(3), 281–287 (2017)

    Google Scholar 

  10. Fu, A., Yu, S., Zhang, Y., Wang, H., Huang, C.: NPP: a new privacy-aware public auditing scheme for cloud data sharing with group users. IEEE Trans. Big Data (2017). https://doi.org/10.1109/TBDATA.2017.2701347

  11. Ateniese, G., et al.: Provable data possession at untrusted stores. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 598–609. ACM, October 2007

    Google Scholar 

  12. Wang, C., Chow, S.S., Wang, Q., Ren, K., Lou, W.: Privacy-preserving public auditing for secure cloud storage. IEEE Trans. Comput. 62(2), 362–375 (2013)

    Article  MathSciNet  Google Scholar 

  13. Wang, H., He, D., Yu, J., Wang, Z.: Incentive and unconditionally anonymous identity-based public provable data possession. IEEE Trans. Serv. Comput. 12, 824–835 (2016)

    Article  Google Scholar 

  14. Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90–107. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89255-7_7

    Chapter  Google Scholar 

  15. Ramesh, D., Mishra, R., Edla, D.R.: Secure data storage in cloud: an e-stream cipher-based secure and dynamic updation policy. Arab. J. Sci. Eng. 42(2), 873–883 (2017)

    Article  MathSciNet  Google Scholar 

  16. Ramesh, D., Mishra, R., Pandit, A.K.: An efficient stream cipher based secure and dynamic updation method for cloud data centre. In: Zelinka, I., Senkerik, R., Panda, G., Lekshmi Kanthan, P.S. (eds.) ICSCS 2018. CCIS, vol. 837, pp. 505–516. Springer, Singapore (2018). https://doi.org/10.1007/978-981-13-1936-5_53

    Chapter  Google Scholar 

  17. Erway, C.C., Kupcu, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. ACM Trans. Inf. Syst. Secur. (TISSEC) 17(4), 15 (2015)

    Article  Google Scholar 

  18. Tian, H., et al.: Dynamic-hash-table based public auditing for secure cloud storage. IEEE Trans. Serv. Comput. 10(5), 701–714 (2017)

    Article  Google Scholar 

  19. Zhang, X., Zhao, J., Mu, L., Tang, Y., Xu, C.: Identity-based proxy-oriented outsourcing with public auditing in cloud-based medical cyber-physical systems. Pervasive Mob. Comput. 56, 18–28 (2019)

    Article  Google Scholar 

  20. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416–432. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-39200-9_26

    Chapter  Google Scholar 

  21. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297–319 (2004)

    Article  MathSciNet  Google Scholar 

  22. Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275–292. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-30574-3_19

    Chapter  Google Scholar 

Download references

Acknowledgement

This research work is supported by Indian Institute of Technology (ISM), Dhanbad, Govt. of India. The authors wish to express their gratitude and heartiest thanks to the Department of Computer Science & Engineering, Indian Institute of Technology (ISM), Dhanbad, India for providing their research support.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dharavath Ramesh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mishra, R., Ramesh, D., Edla, D.R., Sah, M.K. (2020). Binary Binomial Tree Based Secure and Efficient Electronic Healthcare Record Storage in Cloud Environment. In: Rautaray, S., Eichler, G., Erfurth, C., Fahrnberger, G. (eds) Innovations for Community Services. I4CS 2020. Communications in Computer and Information Science, vol 1139. Springer, Cham. https://doi.org/10.1007/978-3-030-37484-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37484-6_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37483-9

  • Online ISBN: 978-3-030-37484-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics