{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:23:38Z","timestamp":1762507418864,"version":"build-2065373602"},"reference-count":15,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2018,4,27]],"date-time":"2018-04-27T00:00:00Z","timestamp":1524787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>As technologies and services that leverage cloud computing have evolved, the number of businesses and individuals who use them are increasing rapidly. In the course of using cloud services, as users store and use data that include personal information, research on privacy protection models to protect sensitive information in the cloud environment is becoming more important. As a solution to this problem, a self-destructing scheme has been proposed that prevents the decryption of encrypted user data after a certain period of time using a Distributed Hash Table (DHT) network. However, the existing self-destructing scheme does not mention how to set the number of key shares and the threshold value considering the environment of the dynamic DHT network. This paper proposes a method to set the parameters to generate the key shares needed for the self-destructing scheme considering the availability and security of data. The proposed method defines state, action, and reward of the reinforcement learning model based on the similarity of the graph, and applies the self-destructing scheme process by updating the parameter based on the reinforcement learning model. Through the proposed technique, key sharing parameters can be set in consideration of data availability and security in dynamic DHT network environments.<\/jats:p>","DOI":"10.3390\/sym10050136","type":"journal-article","created":{"date-parts":[[2018,4,27]],"date-time":"2018-04-27T12:04:50Z","timestamp":1524830690000},"page":"136","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reinforcement Learning Based Data Self-Destruction Scheme for Secured Data Management"],"prefix":"10.3390","volume":"10","author":[{"given":"Young Ki","family":"Kim","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Yongin-si 17104, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8946-7640","authenticated-orcid":false,"given":"Saeed","family":"Ullah","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Yongin-si 17104, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiuk","family":"Kwon","sequence":"additional","affiliation":[{"name":"Databank Systems, Daegu 705-701, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunchul","family":"Jang","sequence":"additional","affiliation":[{"name":"Databank Systems, Daegu 705-701, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongsoo","family":"Lee","sequence":"additional","affiliation":[{"name":"Databank Systems, Daegu 705-701, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Choong Seon","family":"Hong","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Kyung Hee University, Yongin-si 17104, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,4,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Verma, A., and Kaushal, S. (2011, January 22\u201324). Cloud computing security issues and challenges: A survey. Proceedings of the International Conference on Advances in Computing and Communications, Kochi, India.","DOI":"10.1007\/978-3-642-22726-4_46"},{"key":"ref_2","unstructured":"Geambasu, R., Kohno, T., Levy, A.A., and Levy, H.M. (2009, January 10\u201314). Vanish: Increasing data privacy with self-destructing data. Proceedings of the 18th Conference on USENIX Security Symposium, Montreal, QC, Canada."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kouznetsov, P., and Druschel, P. (2007, January 14\u201317). PeerReview: Practical accountability for distributed systems. Proceedings of the 21st ACM SIGOPS Symposium on Operating Systems Principles, Washington, DC, USA.","DOI":"10.1145\/1294261.1294279"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"2016","journal-title":"Commun. ACM"},{"key":"ref_5","unstructured":"Xie, M. (2003). P2P Systems Based on Distributed Hash Table. [Mater\u2019s Thesis, Department of Computer Science, University of Ottawa]."},{"key":"ref_6","unstructured":"Rhea, S., Geels, D., Roscoe, T., and Kubiatowicz, J. (July, January 27). Handling churn in a DHT. Proceedings of the USENIX Annual Technical Conference, Boston, MA, USA."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","article-title":"Reinforcement learning: A survey","volume":"4","author":"Kaelbling","year":"1996","journal-title":"J. Artif. Intell. Res."},{"key":"ref_8","unstructured":"Zeng, L., Shi, Z., Xu, S., and Feng, D. (December, January 30). SafeVanish: An improved data self-destruction for protecting data privacy. Proceedings of the IEEE International Conference on Cloud Computing Technology and Science, Indianapolis, IN, USA."},{"key":"ref_9","unstructured":"Zeng, L., Chen, S., Wei, Q., and Feng, D. (November, January 31). SeDas: A self-destructing data system based on active storage framework. Proceedings of the Asia-Pacific Magnetic Recording Conference, Singapore."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.jcss.2012.05.008","article-title":"A secure self-destructing scheme for electronic data","volume":"79","author":"Wang","year":"2013","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/TCC.2014.2372758","article-title":"A secure data self-destructing scheme in cloud computing","volume":"2","author":"Xiong","year":"2014","journal-title":"IEEE Trans. Cloud Comput."},{"key":"ref_12","first-page":"139","article-title":"A secure self-destruction scheme with IBE for the internet content privacy","volume":"37","author":"Xiong","year":"2014","journal-title":"Chin. J. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1007\/s12083-014-0295-x","article-title":"A full lifecycle privacy protection scheme for sensitive data in cloud computing","volume":"8","author":"Xiong","year":"2015","journal-title":"Peer Peer Netw. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Tang, Y., Lee, P.P.C., Lui, J.C.S., and Perlman, R. (2010, January 7\u201310). FADE: Secure overlay cloud storage with file assured deletion. Proceedings of the International Conference on Security and Privacy in Communications Systems, Singapore.","DOI":"10.1007\/978-3-642-16161-2_22"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Wang, C., Wang, Q., Ren, K., and Lou, W. (2010, January 15\u201319). Privacy preserving public auditing for storage security in cloud computing. Proceedings of the IEEE Conference on Computer Communications, San Diego, CA, USA.","DOI":"10.1109\/INFCOM.2010.5462173"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/5\/136\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:02:29Z","timestamp":1760194949000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/5\/136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,27]]},"references-count":15,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,5]]}},"alternative-id":["sym10050136"],"URL":"https:\/\/doi.org\/10.3390\/sym10050136","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2018,4,27]]}}}