Downloads

EFFICIENT USER REVOCATION FOR DYNAMIC GROUPS IN THE CLOUD

Authors

Kanya Devi J, Kanimozhi S1

Abstract

Mona, secure data sharing in a multi-owner manner for dynamic groups preserves data, identity privacy from an untrusted cloud and allows frequent change of the membership. In RLS while the number of invoked users grows larger, the length of RL increases. To send all user revocation details to the group members for sharing purpose, leads to communication overhead .To address this issue, in this paper, By leveraging group signature and dynamic broadcast encryption techniques and for overall security Elliptic curve cryptography(ECC) algorithm is used, so that any cloud user can anonymously share data with others. The storage overhead and encryption computation cost of the scheme are independent with the number of revoked users.

Article Details

Published

2014-02-28

Section

Articles

How to Cite

EFFICIENT USER REVOCATION FOR DYNAMIC GROUPS IN THE CLOUD. (2014). International Journal of Engineering and Computer Science, 3(02). https://ijecs.in/index.php/ijecs/article/view/113