Enhanced Dynamic Secure group Sharing Using OTP in Public Cloud
Y. Rajesh Babu, U.Usha Rani, , ,
Affiliations M.Tech (CSE), Priyadarshini Institute of Technology & ScienceAssociate Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Science
- In cloud computing outsourcing, cluster quality among cloud shoppers could be a noteworthy check, thus cloud computing
offers a token effort and everyone around sorted out the arrangement. Thanks to incessant modification of participation, sharing info
during a exceedingly in a very} multi-owner manner to an un-trusted cloud continues to be its testing issue. During this paper, we tend to
planned a protected multi-owner info sharing arrange for a dynamic cluster in folks, in general, cloud. By furnishing AES cryptography with
convergent key whereas transferring the data, any cloud shopper will safely impart info to others. Within the in the meantime, the capability
overhead and cryptography calculation expense of the arrange area unit free with the number of disowned shoppers. Also, I break down
the protection of this arrange with thorough confirmations. One-Time Secret word is one in all the best and most well-known varieties of
confirmation which will be utilized for securing access to accounts. One-Time Passwords area unit oftentimes alluded to as secure and a
lot of grounded varieties of confirmation in an exceedingly multi-owner manner. Broad security and execution examination demonstrates
that our planned arrange is deeply productive and fulfills the protection requirements for open cloud-based secure cluster sharing.
Y. Rajesh Babu,U.Usha Rani."Enhanced Dynamic Secure group Sharing Using OTP in Public Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.856-861, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1209.pdf,
Keywords : Cloud computing, broadcast encryption.
 L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, “Group formation in large social networks: membership, growth, and evolution,” in ACM SIGKDD2006: Proc. 12th international conference on Knowledge discovery and data mining. ACM, 2006, pp. 44–54.
 A. T. Sherman and D. A. McGrew, “Key establishment in large dynamic groups using one-way function trees,” IEEE Transactions on Software Engineering, vol. 29, no. 5, pp. 444–458, 2003.
 C. K. Wong, M. Gouda, and S. S. Lam, “Secure group communications using key graphs,” IEEE-ACM Transactions on Networking, vol. 8, no. 1, pp. 16–30, 2000.
 M. Steiner, G. Tsudik, and M. Waidner, “Key agreement in dynamic peer groups,” IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769–780, 2000.
 Y. Kim, A. Perrig, and G. Tsudik, “Group key agreement efficient in communication,” IEEE Transactions on Computers, vol. 53, no. 7, pp. 905– 921, 2004.
 W. Yu, Y. Sun, and K. R. Liu, “Optimizing the rekeying cost for contributory group key agreement schemes,” IEEE Transactions on Dependable and Secure Computing, vol. 4, no. 3, pp. 228–242, 2007.
 W. Trappe, Y. Wang, and K. R. Liu, “Resourceaware conference key establishment for heterogeneous networks,” IEEE-ACM Transactions on Networking, vol. 13, no. 1, pp. 134–146, 2005.
 Y. Kim, A. Perrig, and G. Tsudik, “Tree-based group key agreement,” ACM Transactions on Information and System Security (TISSEC), vol. 7, no. 1, pp. 60–96, 2004.
 V.Sathana, J.Shanthini” Enhanced Security System for Dynamic Group in Cloud” International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 3, March 2014
We have kept IJCERT is a free peer-reviewed scientific journal to endorse conservation. We have not put up a paywall to readers, and we do not charge for publishing. But running a monthly journal costs is a lot. While we do have some associates, we still need support to keep the journal flourishing. If our readers help fund it, our future will be more secure.