Visible to the public Dynamic Graph Based Encryption Scheme for Cloud Based Services and Storage

TitleDynamic Graph Based Encryption Scheme for Cloud Based Services and Storage
Publication TypeConference Paper
Year of Publication2021
AuthorsMohan, K. Madan, Yadav, B V Ram Naresh
Conference Name2021 9th International Conference on Cyber and IT Service Management (CITSM)
Date PublishedSept. 2021
PublisherIEEE
ISBN Number978-1-6654-3548-2
Keywordscloud computing, Cloud Security, Computer architecture, fine-grained, Genetics, graph partition, Heuristic algorithms, Mobile handsets, NP-hard, NP-hard problem, predictability, pubcrawl, resilience, Resiliency, Scalability, Security Heuristics, Software
Abstract

Cloud security includes the strategies which works together to guard data and infrastructure with a set of policies, procedures, controls and technologies. These security events are arranged to protect cloud data, support supervisory obedience and protect customers' privacy as well as setting endorsement rules for individual users and devices. The partition-based handling and encryption mechanism which provide fine-grained admittance control and protected data sharing to the data users in cloud computing. Graph partition problems fall under the category of NP-hard problems. Resolutions to these problems are generally imitative using heuristics and approximation algorithms. Partition problems strategy is used in bi-criteria approximation or resource augmentation approaches with a common extension of hyper graphs, which can address the storage hierarchy.

URLhttps://ieeexplore.ieee.org/document/9588909
DOI10.1109/CITSM52892.2021.9588909
Citation Keymohan_dynamic_2021