A Cross Tenant Access Control (CTAC) Model for Cloud Computing: Formal Specification and Verification

0
971
A Cross Tenant Access Control (CTAC) Model for Cloud Computing: Formal Specification and Verification

A Cross Tenant Access Control (CTAC) Model for Cloud Computing:
Formal Specification and Verification

Abstract

The sharing of resources on the cloud can be achieved on a large scale as it is cost-effective and location-independent. Despite the hype surrounding cloud computing, due to concerns about secure resource sharing, organizations are still reluctant to deploy their businesses in the cloud computing environment. We propose a A Cross Tenant Access Control (CTAC) Model for Cloud Computing: Formal Specification and Verification cloud resource mediation service offered by cloud service providers in this paper, which plays the role of trusted third party among its various tenants.
 
In the presence of our proposed cloud resource mediation service, this A Cross Tenant Access Control (CTAC) Model for Cloud Computing: Formal Specification and Verification paper formally specifies the resource sharing mechanism between two different tenants. Using formal verification, the correctness of the activation of permission and delegation mechanism among different tenants using four distinct algorithms (activation, delegation, forward revocation, and backward revocation).

System Configuration

H/W System Configuration

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
 
S/W System Configuration
 
Platform                     :  cloud computing
 
Operating system       : Windows Xp,7,
 
Server                       : WAMP/Apache
 
Working on                : Browser Like Firefox, IE
 

Advantages

  • HLPN provides graphical and mathematical representations of the system, which facilitates the analysis of its reactions to a given input. Therefore, we are able to understand the links between different system entities and how information is processed.
  • We then verify the model by translating the HLPN using bounded model checking. For this purpose, we use Satisfiability Modulo Theories Library (SMT-Lib) and solver. We remark that such formal verification has previously been used to evaluate security protocols