High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Secure Key Agreement Model for Group Data Sharing in Cloud Computing

Author(s):

Khilesh Rama Barela , Loknete Gopinathji Munde Institute of Engineering Education & Research; Sameer Govind Wagh, Loknete Gopinathji Munde Institute of Engineering Education & Research; Vishal Rajaram Walunj, Loknete Gopinathji Munde Institute of Engineering Education & Research; Madan Tukaram Kutke, Loknete Gopinathji Munde Institute of Engineering Education & Research; Prof. Priyanka R. Naoghare, Loknete Gopinathji Munde Institute of Engineering Education & Research

Keywords:

Group Data Sharing, Cloud Computing

Abstract

Data sharing in cloud computing allows multiple participants to freely share the group data, that improves the potency of work in cooperative environments and has widespread potential applications. However, a way to make sure the security of data sharing within and the way to with efficiency share the outsourced knowledge in an exceedingly group manner square measure formidable challenges. Note that key agreement protocols have compete a really necessary role in secure and economical group data sharing in cloud computing. In this paper, by taking advantage of the symmetric balanced incomplete block style (SBIBD), we present a novel block design-based key agreement protocol that supports multiple participants, which may flexibly extend the quantity of participants in an exceedingly cloud surroundings the structure of the block design. supported the planned group data sharing model, A key agreement protocol is used to generate a common conference key for multiple participants to ensure the security of their later communications, and this protocol can be applied in cloud computing to support secure and efficient data sharing. We proposed a block design based key agreement protocol in which, TPA find malicious user from group and remove from group we have a tendency to gift general formulas for generating the common conference key K for multiple participants. Note that by taking advantage of the (v; k + 1; 1)-block design, the computational complexity of the planned protocol linearly will increase with the quantity of participants and also the communication quality is greatly reduced. additionally, the fault tolerance property of our protocol allows the group data sharing in cloud computing to face up to different key attacks, that is analogous to Yi's protocol.

Other Details

Paper ID: IJSRDV5I70234
Published in: Volume : 5, Issue : 7
Publication Date: 01/10/2017
Page(s): 407-410

Article Preview

Download Article