Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{146690,
        author = {K.T.ARCHANA and R.NITHYA and G.JAYAKUMAR and T.DHARANIKA},
        title = {A Random Access Multi CSP For Dynamic Group Algorithm For Group Shared Data In Cloud Computing},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {5},
        number = {1},
        pages = {593-596},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=146690},
        abstract = {A secure way for key distribution without any secure communication channels, and the users can securely obtain their private keys from group manager. Second, scheme can achieve fine-grained access control, any user in the group can use the source in the cloud and revoked users cannot access the cloud again after they are revoked. Protect the scheme from collusion attack, which means that revoked users cannot get the original data file even if they conspire with the untrusted cloud. In our approach, by leveraging polynomial function, we can achieve a secure user revocation scheme. Finally, our scheme can achieve fine efficiency, which means previous users need not to update their private keys for the situation either a new user joins in the group or a user is revoked from the group. We propose a random access multi csp for dynamic group algorithm for overcoming the above drawback. Through this the data guarding will be ensured and the Qos will be maintained. The attackers will find difficult to gather server details because of changing the cloud server frequently. This improves networking performance and secure data from being attacked.},
        keywords = {},
        month = {},
        }