Skip to main content

Data Deterministic Deletion Scheme Based on DHT Network and Fragmentation Deletion

  • Conference paper
  • First Online:
Geo-Spatial Knowledge and Intelligence (GSKI 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 848))

Included in the following conference series:

  • 1149 Accesses

Abstract

During the life cycle of the cloud data, the technique of data deterministic deletion is designed to completely destroy the data and ensures that cloud data that is out of date or backed up in the cloud server is completely deleted or will never be decrypted or accessed. However, the existing scheme simply deletes the key or the cipher text. Once the key or the cloud backup of the cipher text is stolen, data privacy will be threatened. For this reason, this paper proposes a data deletion scheme that is dynamic deletion is based on fragmented cipher text and key. The core of this scheme is to use the dynamic characteristics of DHT network to realize the periodic deletion of fragmented cipher text. Using the idea of fragmented cipher text dynamic deletion, in the unauthorized time even if in the case that the key is leaked, illegal user can not get all the cipher text and key, and can not restore the complete data. The theoretical analysis and experimental results show that the scheme can effectively delete some fragmented cipher texts and key, and has low performance cost, which can meet the requirements for deterministic deletion of excessive data or backup files in cloud storage system.

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

References

  1. Perlman, R.: File system design with assured delete. In: SISW 2005 Proceeding of the Third IEEE International Security in Storage Workshop, pp. 83–88 (2005)

    Google Scholar 

  2. Tang, Y., Lee, P.P.C, Lui, J.C.S., et al.: FADE: secure overlay cloud storage with file assured deletion. In: Proceedings of the SecureComm 2010, pp. 380–397. ACM Press, New York (2010)

    Google Scholar 

  3. Yue, F., Wang, G., Liu, Q.: A secure self-destruct-ing scheme for electronic data. In: Proceedings of EUC 2010, pp. 651–658. IEEE Press, New York (2010)

    Google Scholar 

  4. Zeng, L., Shi, Z., Xu, S., et al.: Safevanish: animproved data self-destruction for protecting data privacy. In: Proceedings of CloudCom 2010, pp. 521–528. IEEE Press, New York (2010)

    Google Scholar 

  5. Zhang, K., Yang, C., Ma, J., Zhang, J.: Study on deterministic deletion of cloud data based on cipher text sampling fragmentation. J. Commun. 11, 108–117 (2015)

    Google Scholar 

  6. Wang, Li-na, Ren, Zheng-wei, Yu, Rong-wei, Han, Feng, Dong, Yong-feng: A method for deterministic data removal for cloud storage. Acta Electr. J. 02, 266–272 (2012)

    Google Scholar 

  7. Wang, W., Li, Z., Owens, R., et al.: Secure and efficient access to outsourced data. In: Proceedings of CCSW 2009, pp. 55–65. ACM Press, New York (2009)

    Google Scholar 

  8. Wei, A.: DHT Network Measurement and Analysis. University of Electronic Science and Technology (2011)

    Google Scholar 

  9. Stoica, I., Morris, R., Karger, D., et al.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the SIGCOMM 2001, pp. 149–160. ACM Press, New York (2001)

    Google Scholar 

  10. Dabek, F.: A Distributed Hash Table. Massachusetts Institute of Technology, Massachusetts (2005)

    Google Scholar 

  11. Huan-ping, L.I.U., Yi-xian, Y.A.N.G.: Generalized (k, n) - threshold scheme. J. Commun. 08, 73–78 (1998)

    Google Scholar 

Download references

Acknowledgments

This research was supported by the Postgraduate Education Innovation Projects of Shandong Province of China under Grant No.SDYC15042. In addition, the authors would like to thank the reviewers for their valuable comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nengneng Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, Y., Li, N., Cui, R., Fan, Y. (2018). Data Deterministic Deletion Scheme Based on DHT Network and Fragmentation Deletion. In: Yuan, H., Geng, J., Liu, C., Bian, F., Surapunt, T. (eds) Geo-Spatial Knowledge and Intelligence. GSKI 2017. Communications in Computer and Information Science, vol 848. Springer, Singapore. https://doi.org/10.1007/978-981-13-0893-2_45

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0893-2_45

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0892-5

  • Online ISBN: 978-981-13-0893-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics