A Dynamic Secure Group Sharing Framework in Public Cloud Computing

Abstract

With the popularity of group data sharing in public cloud computing, the privacy and security of group sharing data have become two major issues. The cloud provider cannot be treated as a trusted third party because of its semi-trust nature, and thus the traditional security models cannot be straightforwardly generalized into cloud based group sharing frameworks. In this paper, we propose a novel secure group sharing framework for public cloud, which can effectively take advantage of the Cloud Servers’ help but have no sensitive data being exposed to attackers and the cloud provider. The framework combines proxy signature, enhanced TGDH and proxy re-encryption together into a protocol. By applying the proxy signature technique, the group leader can effectively grant the privilege of group management to one or more chosen group members. The enhanced TGDH scheme enables the group to negotiate and update the group key pairs with the help of Cloud Servers, which does not require all of the group members been online all the time. By adopting proxy re-encryption, most computationally intensive operations can be delegate to Cloud Servers without disclosing any private information. Extensive security and performance analysis shows that our proposed scheme is highly efficient and satisfies the security requirements for public cloud based secure group sharing.

Aim

The main aim is to provide privacy and security of group sharing data in public cloud computing.

Scope

The scope is to combine proxy signature, enhanced TGDH (Tree-Based Group Diffie-Hellman) and proxy re-encryption together into a protocol to effectively grant the privilege of group management and to negotiate and update the group key pairs.

Existing System

­­The security of group communication applications can be ensured by group key agreement which can provide both backward secrecy and forward secrecy which are not totally the same as that defined in cloud based group sharing. These schemes can be divided into two categories: centralized and distributed all of which require all group members to be online together during the protocol implementation. Unfortunately, it’s difficult to have such “online together” guarantee in group applications in the cloud. How to make sure that such group applications in the cloud are secure and reliable remains a challenging problem. From what we know, only the work in makes a preliminary attempt, which provides a fully distributed TGDH (TreeBased Group Diffie-Hellman) based scheme. Although the scheme only requires asynchronous communication channels, it still requires the group members to participate in the process of protocol implementing and receive some others’ sent messages when members’ joining and/or leaving. Meanwhile, if a group member acting as a sponsor keeps in storing the private key of the shadow node, when he/she leaves the group, it is hard to keep backward secrecy in this scheme.

Disadvantages

·      With the popularity of group data sharing in public cloud computing, the privacy and security of group sharing data have become two major issues.

·      Existing system requires all of the group members been online all the time.

·      It still requires the group members to participate in the process of protocol implementing and receive some others’ sent messages when members’ joining and/or leaving. Meanwhile, if a group member acting as a sponsor keeps in storing the private key of the shadow node, when he/she leaves the group, it is hard to keep backward secrecy in this scheme.

Proposed System

Our work gives the extension to it to make more operability when any member online or offline at any time. In this project, based on Cloud Servers’ help, Group members can implement key synchronization when they become online in the next time.

1) The proposed scheme supports the updating of the group key pair whenever group members’ joining or leaving happens, which transfers most of the computational complexity and communication overhead to Cloud Servers without leaking the privacy.

2) Privilege of group management can be granted to any specific group member, which can be revoked at any time.

3) Enhanced on the original TGDH, with the help of Cloud Servers, the proposed scheme enables the group to negotiate and update the group key pairs even though not all of the group members are online together.

Any offline group member can launch group key synchronization when he/she becomes online again in the next time.

Advantages

·      Extensive security and performance analysis shows that our proposed scheme is highly efficient and satisfies the security requirements for public cloud based secure group sharing.

·      A novel secure group sharing framework for public cloud, which can effectively take advantage of the Cloud Servers’ help but have no sensitive data being exposed to attackers and the cloud provider.

System Architecture

  

System Configuration

Hardware Requirements

• Speed                  -    1.1 Ghz
• Processor              -    Pentium IV
• RAM                    -    512 MB (min)
• Hard Disk            -    40 GB
• Key Board                    -    Standard Windows Keyboard
• Mouse                  -    Two or Three Button Mouse
• Monitor                -     LCD/LED

 Software requirements

• Operating System              : Windows 7             
•  Front End                           : ASP.Net and C#
• Database                             : MSSQL
• Tool                                    : Microsoft Visual studio

References

Peilin Hong, Kaiping Xue “A DYNAMIC SECURE GROUP SHARING FRAMEWORK IN PUBLIC CLOUD COMPUTING” Cloud Computing, IEEE Transactions on  (Volume:2 ,  Issue: 4 ) October 2014

A PROFIT MAXIMIZATION SCHEME WITH GUARANTEED QUALITY OF SERVICE IN CLOUD COMPUTING

ABSTRACT

As an effective and efficient way to provide computing resources and services to customers on demand, cloud computing has become more and more popular. From cloud service providers’ perspective, profit is one of the most important considerations, and it is mainly determined by the configuration of a cloud service platform under given market demand. However, a single long-term renting scheme is usually adopted to configure a cloud platform, which cannot guarantee the service quality but leads to serious resource waste. In this paper, a double resource renting scheme is designed firstly in which short-term renting and long-term renting are combined aiming at the existing issues. This double renting scheme can effectively guarantee the quality of service of all requests and reduce the resource waste greatly. Secondly, a service system is considered as an M/M/m+D queuing model and the performance indicators that affect the profit of our double renting scheme are analyzed, e.g., the average charge, the ratio of requests that need temporary servers, and so forth. Thirdly, a profit maximization problem is formulated for the double renting scheme and the optimized configuration of a cloud platform is obtained by solving the profit maximization problem. Finally, a series of calculations are conducted to compare the profit of our proposed scheme with that of the single renting scheme. The results show that our scheme can not only guarantee the service quality of all requests, but also obtain more profit than the latter.

AIM

The aim of this paper a double resource renting scheme is designed firstly in which short-term renting and long-term renting are combined aiming at the existing issues.

SCOPE

The scope of this paper tends to show that our scheme can not only guarantee the service quality of all requests, but also obtain more profit than the latter.

EXISTING SYSTEM

service provider usually adopts a single renting scheme. That’s to say, the servers in the service system are all long-term rented. Because of the limited number of servers, some of the incoming service requests cannot be processed immediately. So they are first inserted into a queue until they can handled by any available server. However, the waiting time of the service requests cannot be too long. In order to satisfy quality-of-service requirements, the waiting time of each incoming service request should be limited within a certain range, which is determined by a service-level agreement (SLA). If the quality of service is guaranteed, the service is fully charged, otherwise, the service provider serves the request for free as a penalty of low quality. To obtain higher revenue, a service provider should rent more servers from the infrastructure providers or scale up the server execution speed to ensure that more service requests are processed with high service quality. However, doing this would lead to sharp increase of the renting cost or the electricity cost. Such increased cost may counterweight the gain from penalty reduction. In conclusion, the single renting scheme is not a good scheme for service providers

DISADVANTAGES

1. A single long-term renting scheme is usually adopted to configure a cloud platform, which cannot guarantee the service quality but leads to serious resource waste.
2. The cost is the renting cost paid to the infrastructure providers plus the electricity cost caused by energy consumption, and the revenue is the service charge to customers.

PROPOSED SYSTEM

In this paper, propose a novel renting scheme for service providers, which not only can satisfy quality-of-service requirements, but also can obtain more profit. Our contributions in this paper can be summarized as follows. A novel double renting scheme is proposed for service providers. It combines long-term renting with short-term renting, which can not only satisfy quality-of-service requirements under the varying system workload, but also reduce the resource waste greatly.  A multi server system adopted in our paper is modeled as an M/M/m+D queuing model and the performance indicators are analyzed such as the average service charge, the ratio of requests that need short term servers, and so forth.  The optimal configuration problem of service providers for profit maximization is formulated and two kinds of optimal solutions, i.e., the ideal solutions and the actual solutions, are obtained respectively. A series of comparisons are given to verify the performance of our scheme. The results show that the proposed Double-Quality-Guaranteed (DQG) renting scheme can achieve more profit than the compared Single-Quality-Unguaranteed (SQU) renting scheme in the premise of guaranteeing the service quality completely.

ADVANTAGES

1.  This scheme combines short-term renting with long-term renting, which can reduce the resource waste greatly and adapt to the dynamical demand of computing capacity.
2. The results show that our scheme outperforms the SQU scheme in terms of both of service quality and profit.

 SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION:-

Hardware Requirements

• Speed                  -    1.1 Ghz
• Processor              -    Pentium IV
• RAM                    -    512 MB (min)
• Hard Disk            -    40 GB
• Key Board                    -    Standard Windows Keyboard
• Mouse                  -    Two or Three Button Mouse
• Monitor                -     LCD/LED

 Software requirements

• Operating System              : Windows 7             
•  Front End                           : ASP.Net and C#
• Database                             : MSSQL
• Tool                                    : Microsoft Visual studio

REFERENCE

Li, K. ; Ouyang, A. ; Li, K. Mei, J. “A Profit Maximization Scheme with Guaranteed Quality of Service in Cloud Computing” IEEE Transactions on Computers, VOL PP,ISS 99, February 2015.

A SCALABLE AND RELIABLE MATCHING SERVICE FOR CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS

ABSTRACT

Characterized by the increasing arrival rate of live content, the emergency applications pose a great challenge: how to disseminate large-scale live content to interested users in a scalable and reliable manner. The publish/subscribe (pub/sub) model is widely used for data dissemination because of its capacity of seamlessly expanding the system to massive size. However, most event matching services of existing pub/sub systems either lead to low matching throughput when matching a large number of skewed subscriptions, or interrupt dissemination when a large number of servers fail. The cloud computing provides great opportunities for the requirements of complex computing and reliable communication. In this paper, we propose SREM, a scalable and reliable event matching service for content-based pub/sub systems in cloud computing environment. To achieve low routing latency and reliable links among servers, we propose a distributed overlay Skip Cloud to organize servers of SREM. Through a hybrid space partitioning technique HPartition, large-scale skewed subscriptions are mapped into multiple subspaces, which ensures high matching throughput and provides multiple candidate servers for each event. Moreover, a series of dynamics maintenance mechanisms are extensively studied. To evaluate the performance of SREM, 64 servers are deployed and millions of live content items are tested in a CloudStack testbed. Under various parameter settings, the experimental results demonstrate that the traffic overhead of routing events in Skip Cloud is at least 60% smaller than in Chord overlay, the matching rate in SREM is at least 3.7 times and at most 40.4 times larger than the single-dimensional partitioning technique of Blue Dove. Besides, SREM enables the event loss rate to drop back to 0 in tens of seconds even if a large number of servers fail simultaneously.

AIM

The aim of this paper is To achieve low routing latency and reliable links among servers, we propose a distributed overlay Skip Cloud to organize servers of SREM..

SCOPE

The scope of this paper tend to evaluate the performance of SREM, 64 servers are deployed and millions of live content items are tested in a CloudStack testbed.

EXISTING SYSTEM

Recently, cloud computing provides great opportunities for the applications of complex computing and high speed communication , where the servers are connected by high speed networks, and have powerful computing and storage capacities. A number of pub/sub services based on the cloud computing environment have been proposed, such as Move,BlueDove and SEMAS . However, most of them can not completely meet the requirements of both scalability and reliability when matching large scale live content under highly dynamic environments. This mainly stems from the following facts:1) Most of them are inappropriate to the matching of live content with high data dimensionality due to the limitation of their subscription space partitioning techniques, which bring either low matching throughput or high memory overhead. 2) These systems adopt the one-hop lookup technique among servers to reduce routing latency. In spite of its high efficiency, it requires each dispatching server to have the same view of matching servers. Otherwise, the subscriptions or events may be assigned to the wrong matching servers, which brings the availability problem in the face of current joining or crash of matching servers. A number of schemes can be used to keep the consistent view, like periodically sending heartbeat messages to dispatching servers or exchanging messages among matching servers. However, these extra schemes may bring a large traffic overhead or the interruption of event matching service.

DISADVANTAGES

1. To disseminate large-scale live content to interested users in a scalable and reliable manner
2. Most event matching services of existing pub/sub systems either lead to low matching throughput when matching a large number of skewed subscriptions, or interrupt dissemination when a large number of servers fail

PROPOSED SYSTEM

In this paper propose a scalable and reliable matching service for content-based pub/sub service in cloud computing environments, called SREM. Specifically, we mainly focus on two problems: one is how to organize servers in the cloud computing environment to achieve scalable and reliable routing. The other is how to manage subscriptions and events to achieve parallel matching among these servers. a distributed overlay protocol, called Skip Cloud, to organize servers in the cloud computing environment. Skip Cloud enables subscriptions and events to be forwarded among brokers in a scalable and reliable manner. Also it is easy to implement and maintain. To achieve scalable and reliable event matching among multiple servers, we propose a hybrid multi-dimensional space partitioning technique, called HPartition. It allows similar subscriptions to be divided into the same server and provides multiple candidate matching servers for each event. Moreover, it adaptively alleviates hot spots and keeps workload balance among all servers.

ADVANTAGES

1. Through a hybrid multi-dimensional space partitioning technique, SREM reaches scalable and balanced clustering of high dimensional skewed subscriptions, and each event is allowed to be matched on any of its candidate servers
2. Extensive experiments with real deployment based on a Cloud Stack testbed are conducted, producing results which demonstrate that SREM is effective and practical, and also presents good workload balance, scalability and reliability under various parameter settings.

 SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board         -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System       : Windows  7                                    

·                Front End                  : JSP AND SERVLET

·                Database                  : MYSQL

·                Tool                           :NETBEANS

REFERENCE

Yijie Wang ; Xiaoqiang Pei, Xingkong Ma “A SCALABLE AND RELIABLE MATCHING SERVICE FOR CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS” IEEE Transactions on Cloud Computing, Volume 3 ,  Issue 1 July 2014.

An Authenticated Trust and Reputation Calculation and Management System for Cloud and Sensor Networks Integration

ABSTRACT

Induced by incorporating the powerful data storage and data processing abilities of cloud computing (CC) as well as ubiquitous data gathering capability of wireless sensor networks (WSNs), CC-WSN integration received a lot of attention from both academia and industry. However, authentication as well as trust and reputation calculation and management of cloud service providers (CSPs) and sensor network providers (SNPs) are two very critical and barely explored issues for this new paradigm. To fill the gap, this paper proposes a novel authenticated trust and reputation calculation and management (ATRCM) system for CC-WSN integration. Considering (i) the authenticity of CSP and SNP; (ii) the attribute requirement of cloud service user (CSU) and CSP; (iii) the cost, trust and reputation of the service of CSP and SNP, the proposed ATRCM system achieves the following three functions: 1) authenticating CSP and SNP to avoid malicious impersonation attacks; 2) calculating and managing trust and reputation regarding the service of CSP and SNP; 3) helping CSU choose desirable CSP and assisting CSP in selecting appropriate SNP. Detailed analysis and design as well as further functionality evaluation results are presented to demonstrate the effectiveness of ATRCM, followed with system security analysis.

AIM

The aim of this paper is paper proposes a novel authenticated trust and reputation calculation and management (ATRCM) system for CC-WSN integration

SCOPE

The scope of this paper ATRCM system achieves the following three functions: 1) authenticating CSP and SNP to avoid malicious impersonation attacks; 2) calculating and managing trust and reputation regarding the service of CSP and SNP; 3) helping CSU choose desirable CSP and assisting CSP in selecting appropriate SNP

EXISTING SYSTEM

Malicious attackers may impersonate authentic CSPs to communicate with CSUs, or fake to be authentic SNPs to communicate with CSPs. Then CSUs and CSPs cannot eventually achieve any service from the fake CSPs and SNPs respectively. In the meantime, the trust and reputation of the genuine CSPs and SNPs are also impaired by these fake CSPs and SNPs. Without trust and reputation calculation and management of CSPs and SNPs, it is easy for CSU to choose a CSP with low trust and reputation. Then the service from CSP to CSU fails to be successfully delivered quite often. Moreover, CSP may easily select an untrustworthy SNP that delivers the service that the CSP requests with an unacceptable large latency. Moreover, the untrustworthy SNP probably may only be able to provide the requested service for a very short time period unexpectedly

DISADVANTAGES:

1.  Authentication of CSPs and SNPs
2. Trust and reputation calculation and management of CSPs and SNP

PROPOSED SYSTEM

In this paper, further proposes an ATRCM system for the CC-WSN integration. It incorporates authenticating CSP and SNP, and then considers the attribute requirement of CSU and CSP as well as cost, trust and reputation of the service of CSP and SNP, to enable CSU to choose authentic and desirable CSP and assists CSP in selecting genuine and appropriate SNP.

ADVANTAGES:

1. Authenticating CSP and SNP to avoid malicious impersonation attacks
2. Calculating and managing trust and reputation regarding the service of CSP and SNP
3. Helping CSU choose desirable CSP and assisting CSP in selecting appropriate SNP

 SYSTEM ARCHITECTURE

SYSTEM CONFIGURATION:-

Hardware Requirements

• Speed                  -    1.1 Ghz
• Processor              -    Pentium IV
• RAM                    -    512 MB (min)
• Hard Disk            -    40 GB
• Key Board                    -    Standard Windows Keyboard
• Mouse                  -    Two or Three Button Mouse
• Monitor                -     LCD/LED

 Software requirements

• Operating System              : Windows 7             
•  Front End                           : ASP.Net and C#
• Database                             : MSSQL
• Tool                                    : Microsoft Visual studio

REFERENCES

Chunsheng Zhu, Nicanfar, H. , Leung, V.C.M. , Yang, L.T.”An Authenticated Trust and Reputation Calculation and Management System for Cloud and Sensor Networks Integration” IEEE Transactions On Information Forensics And Security, VOL 10,ISS 1, OCTOBER  2014.