Manuscript Number : SHISRRJ247290

Publicly Verifiable and Efficient Fine-Grained Data Deletion Scheme in Cloud Computing

Authors(2) :-S E Suresh, Singannagari Uma Pavani

Data storage and processing has been radically transformed by cloud computing, but it also raises concerns about data privacy and security. In this paper, the authors provide a secure fine-grained deletion scheme for cloud computing that guarantees public verifiability as well as efficiency based on the Advanced Encryption Standard (AES). It also allows the owner of data to erase specific parts of his/her stored information without losing control and privacy. While AES encryption is used to maintain confidentiality of data, public verifiability ensures integrity of deletion process. The proposed scheme provides efficient deletion operations with reduced computational overhead and storage costs. This approach improves data privacy through the integration of AES encryption and fine-grained data deletion mechanisms; it enables efficient management of data while ensuring that owners have confidence in the removal of critical information. Experimental studies demonstrate the effectiveness and efficiency of this design compared with traditional delete methods. Specifically, this flexibility implies its many applications in cloud computing where fine-grained management and wiping out are important aspects.

Authors and Affiliations

S E Suresh
Assistant Professor, Department of MCA, Annamacharya Institute of Technology & Sciences, Tirupati, Andhra Pradesh, India
Singannagari Uma Pavani
Post Graduate, Department of MCA, Annamacharya Institute of Technology & Sciences, Tirupati, Andhra Pradesh, India

Cloud Server, Third Party Authority, Data Deletion Scheme, Deletion Request, Verifiability

  1. R. Buyya, C.J. Yeo,S. Venugopal,S. Yeo,S. Broberg and myself. Brandic," Vision, hype, and reality for delivering computing as the fifth mileage pall computing and arising IT platforms," Future Gener. Computer. System. invol. 25,no. 6,pp. 599- 616, June. doi10.1016/ j in 2009. future. 2008point- 12. 001.
  2. C. Yang andJ. Ye," Fine- granulated data access control scheme in pall calculating secure and effective,"J. Rapid Internet Access. invol. 21, no. runner 4. 259- 271, November 1. doi10.3233/ JHS- 150524( 2015).
  3. S. Han,K." A data sharing protocol to minimize security and sequestration pitfalls of pall storehouse in the big data period," by Han andS. Zhang, IEEE Access,vol. 7,pp. 2019; doi10.1109/ ACCESS; 60290- 60298, 2019.2019.2914862.
  4. C. Yang along withX. Tao," New pall data omission scheme with effective shadowing that's vindicated by the public," in Proc. Inside. Conf. Secure. Brain. Computer. Guilin, China Bigdata Services, 2018, pp. doi10.1007/ 978-3-030-16946-6, 28; 359- 372.
  5. J. Li, Yu. Wang, Yu. Zhang along withJ. Han," Attribute- grounded encryption Complete verifiability for externalized decryption," IEEE Trans. Computer Services. May 31, 2017, doi10.1109/ TSC; early access.2017.2710190.
  6. J. Li,W. Yao, Yu. Zhang,H. Qian as well asJ. Han," Attribute- grounded pall data storehouse that's both flexible and fine- granulated," IEEE Trans. Computer Services. invol. 10,no. 5,pp. 785- 796, September 16. doi10.1109/ TSC, 2017.2016.2520932.
  7. H. Takabi, John.B. Joshi,D., andG.-J. Ahn," pall computing surroundings security and sequestration challenges," IEEE Secur. sequestration Magazine. invol. 8,no. 6, pp. November 24- 31. doi10.1109/ MSP( 2010).2010.186.
  8. J. Li,H. Yan along withY. Zhang," Public integrity checking of group participated data on pall storehouse using instruments," IEEE Trans. Computer Services. beforehand entry, in January. doi10.1109/ TSC; 8, 2018.2018.2789893.
  9. H. Yan,J. Li,J. Han andY. Zhang," A new effective protocol for vindicating the possession of data ever in pall storehouse," IEEE Trans. Inf. Felonious Justice Security, ed. 12,no. 1,pp. 78- 88,Jan. doi10.1109/ TIFS, 2017.2016.2601070.
  10. J. Li,H. Yan along withY. Effective identity- grounded sustainablemulti-copy data possession inmulti-cloud storehouse was bandied by Zhang in the IEEE Trans. Cloud Computing. July, early access. doi10.1109/ TCC; 16, 2019.2019.2929045.
  11. A. Darwish,A.E.M. Elhoseny,A. Hassanien.K. Sangaiah as well asK. Muhammad," The Internet of effects and pall computing mongrel platform's goods on healthcare systems openings, challenges, and undetermined issues,"J. Haha. Computer. invol. 10,no. 10, pp.Oct. 4151- 4166. doi10.1007/ s12652-017-0659-1; 2019,Feb.
  12. PaulM. andA. Saxena," substantiation of erasability to guarantee complete data erasure in pall computing," Proc. Inside. Conf. Netw. Secure. Apply. 2010,pp., Chennai, India. doi0.1007/ 978-3-642-14478-3, 35. 340- 348).
  13. L. Du,Z. Tan,J. ; Zhang, Sdot. Wang along withX. Tao," A affiliated junking plan for multiple clones in pall storehouse," in Proc. Inside. Conf. Archit Algorithms. Process in resemblant. China's Guangzhou, 2018; pp. doi10.1007/ 978-3-030-05063-4, 38. 511- 526).
  14. C. Yang,X. Tao,F. Zhao along withY. Wang," A new empirical public outsourced data omission scheme," in Proc. The 14th Int. Conf. Systems and Wireless Algorithms. Apply. 2019, Honolulu, Hawaii, USA, pp. doi10.1007/ 978-3-030-23597-0, 53. 631- 638.

Publication Details

Published in : Volume 7 | Issue 2 | March-April 2024
Date of Publication : 2024-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 376-383
Manuscript Number : SHISRRJ247290
Publisher : Shauryam Research Institute

ISSN : 2581-6306

Cite This Article :

S E Suresh, Singannagari Uma Pavani, "Publicly Verifiable and Efficient Fine-Grained Data Deletion Scheme in Cloud Computing", Shodhshauryam, International Scientific Refereed Research Journal (SHISRRJ), ISSN : 2581-6306, Volume 7, Issue 2, pp.376-383, March-April.2024
URL : https://shisrrj.com/SHISRRJ247290

Article Preview