Skip to main content

Secure Storage Method for Network Resources of Professional Works Based on Decision Tree Algorithm

  • Conference paper
  • First Online:
Machine Learning for Cyber Security (ML4CS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13656))

Included in the following conference series:

Abstract

Because the work network resources quantity are large, the storage difficulty is great, the security is very difficult to obtain safeguard. Therefore, a method of secure storage for network resources of professional works based on decision tree algorithm is proposed. According to the network resource storage requirements of professional works, the network layer, middleware layer and application layer of the network resource security storage system are constructed. On this basis, the secure storage network communication and its open network protocol are designed through CSocket class and CConsection class, the decision tree is constructed to predict the network load performance, and the work resource cache model is built. By encoding the transmitted work resources, complete the encryption and decryption process of network resources, find network resources based on POP3 protocol, and create the retransmission failure task of main thread and monitoring thread, so as to realize the safe storage of professional work network resources. Experimental results show that the maximum caching efficiency of the proposed method is 94.21%, and the maximum safety factor of the resource storage is 0.9.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Shuai, L., Shuai, W., Xinyu, L., et al.: Fuzzy detection aided real-time and robust visual tracking under complex environments. IEEE Trans. Fuzzy Syst. 29(1), 90–102 (2021)

    Article  Google Scholar 

  2. Huang, C.: research on encryption simulation of attributes based on cloud labdatabase resource cloud storage. Comput. Simul. 37(5): 115–118+123 (2020)

    Google Scholar 

  3. Fei, G., Na, Z.: Design of structure for network resource security cloud storage based on RaptorQ code. Comput. Eng. Softw. 42(10), 135–137 (2021)

    Google Scholar 

  4. Yue, W., Qiu, R.: Research on security factors of cloud storage for academic information resources based on DEMATEL. Inf. Stud. Theory Appl. 43(03), 53–58 (2020)

    Google Scholar 

  5. Praveen, S.P., Sindhura, S., Madhuri, A., et al:. A novel effective framework for medical images secure storage using advanced cipher text algorithm in cloud computing. In: 2021 IEEE International Conference on Imaging Systems and Techniques (IST), pp. 1–4. IEEE (2021)

    Google Scholar 

  6. Gupta, N., Manaswini, R., Saikrishna, B., et al.: Authentication-based secure data dissemination protocol and framework for 5G-enabled VANET. Future Internet 12(4), 63 (2020)

    Article  Google Scholar 

  7. Cao, S., Zhang, X., Xu, R.: Toward secure storage in cloud-based ehealth systems: a blockchain-assisted approach. IEEE Netw. 34(2), 64–70 (2020)

    Article  Google Scholar 

  8. Liu, S., et al.: Human memory update strategy: a multi-layer template update mechanism for remote visual monitoring. IEEE Trans. Multimedia 23, 2188–2198 (2021)

    Article  Google Scholar 

  9. Ayub, M.F., Shamshad, S., Mahmood, K., et al.: A provably secure two-factor authentication scheme for USB storage devices. IEEE Trans. Consum. Electron. 66(4), 98–3063 (2020)

    Article  Google Scholar 

  10. Hou, R., Liu, H., Hu, Y., et al.: Research on secure transmission and storage of energy IoT information based on Blockchain. Peer-to-Peer Netw. Appl. 13(4), 1225–1235 (2020)

    Article  Google Scholar 

  11. Arslan, S.S., Goker, T.: Compress-store on blockchain: a decentralized data processing and immutable storage for multimedia streaming. Clust. Comput. 25(3), 1957–1968 (2022)

    Article  Google Scholar 

  12. Liu, S., Liu, D., Muhammad, K., Ding, W.: Effective template update mechanism in visual tracking with background clutter. Neurocomputing 458, 615–625 (2021)

    Article  Google Scholar 

  13. Wang, Y., Zhang, T., Yang, W., et al.: Secure communication via multiple RF-EH untrusted relays with finite energy storage. IEEE Internet Things J. 7(2), 1476–1487 (2020)

    Article  Google Scholar 

  14. Ebinazer, S.E., Savarimuthu, N., Bhanu, S.: ESKEA: enhanced symmetric key encryption algorithm based secure data storage in cloud networks with data deduplication. Wirel. Pers. Commun. 117(6), 1–17 (2021)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bomei Tan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tan, B., Yu, R. (2023). Secure Storage Method for Network Resources of Professional Works Based on Decision Tree Algorithm. In: Xu, Y., Yan, H., Teng, H., Cai, J., Li, J. (eds) Machine Learning for Cyber Security. ML4CS 2022. Lecture Notes in Computer Science, vol 13656. Springer, Cham. https://doi.org/10.1007/978-3-031-20099-1_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20099-1_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20098-4

  • Online ISBN: 978-3-031-20099-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics