Computer and Information Sciences - Publications

Permanent URI for this collection

https://dspace.uohyd.ac.in/handle/1/9

Browse

Browsing Computer and Information Sciences - Publications by Subject "Access control"
  • Item
    A rough set based PCM for authorizing grid resources
    ( 2010-12-01) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources. That leads to huge repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM) [1]. HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). Further enhancement of HCM is done to make it suitable for dynamic environments [2]. However, HCM is not totally free from repetitions. Moreover, HCM is an expensive process in terms of decision tree size and memory consuming. In this paper, a new Rough Set based PCM is proposed which increases the efficiency of the authorization process and further reduces the redundancy. © 2010 IEEE.
  • Item
    A rough set based PCM for authorizing grid resources
    ( 2010-12-01) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources. That leads to huge repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM) [1]. HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). Further enhancement of HCM is done to make it suitable for dynamic environments [2]. However, HCM is not totally free from repetitions. Moreover, HCM is an expensive process in terms of decision tree size and memory consuming. In this paper, a new Rough Set based PCM is proposed which increases the efficiency of the authorization process and further reduces the redundancy. © 2010 IEEE.
  • Item
    A rough set based PCM for authorizing grid resources
    ( 2010-12-01) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources. That leads to huge repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM) [1]. HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). Further enhancement of HCM is done to make it suitable for dynamic environments [2]. However, HCM is not totally free from repetitions. Moreover, HCM is an expensive process in terms of decision tree size and memory consuming. In this paper, a new Rough Set based PCM is proposed which increases the efficiency of the authorization process and further reduces the redundancy. © 2010 IEEE.
  • Item
    Enhancing the hierarchical clustering mechanism of storing resources' security policies in a grid authorization system
    ( 2010-03-25) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources, which reduces the scalability and leads to huge repetitions in checking security rules. One of the efficient mechanisms that handles these repetitions and increases the scalability is the Hierarchical Clustering Mechanism (HCM) [1]. HCM outperforms the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). This paper enhances HCM to accommodate the dynamism of the grid and the same is demonstrated using new algorithms. © 2010 Springer.
  • Item
    Enhancing the hierarchical clustering mechanism of storing resources' security policies in a grid authorization system
    ( 2010-03-25) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources, which reduces the scalability and leads to huge repetitions in checking security rules. One of the efficient mechanisms that handles these repetitions and increases the scalability is the Hierarchical Clustering Mechanism (HCM) [1]. HCM outperforms the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). This paper enhances HCM to accommodate the dynamism of the grid and the same is demonstrated using new algorithms. © 2010 Springer.
  • Item
    Enhancing the hierarchical clustering mechanism of storing resources' security policies in a grid authorization system
    ( 2010-03-25) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources, which reduces the scalability and leads to huge repetitions in checking security rules. One of the efficient mechanisms that handles these repetitions and increases the scalability is the Hierarchical Clustering Mechanism (HCM) [1]. HCM outperforms the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). This paper enhances HCM to accommodate the dynamism of the grid and the same is demonstrated using new algorithms. © 2010 Springer.
  • Item
    Grid authorization graph
    ( 2013-06-11) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun ; Buyya, Rajkumar
    The heterogeneous and dynamic nature of a grid environment demands a scalable authorization system. This brings out the need for a fast fine-grained access control mechanism for authorizing grid resources. Existing grid authorization systems adopt inefficient mechanisms for storing resources' security policies. This leads to a large number of repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM). HCM reduces the redundancy in checking security rules compared to the Brute Force Approach (BFA) as well as the Primitive Clustering Mechanism (PCM). Further enhancement is done to HCM to increase the scalability of the authorization process. However, HCM is not totally free of repetitions and cannot easily describe the OR-based security policies. A novel Grid Authorization Graph (GAG) is proposed to overcome HCM limitations. GAG introduces special types of edges named "Correspondence Edge"/"Discrepancy Edge" which can be used to entirely eliminate the redundancy and handle the cases where a set of security rules are mutually exclusive. Comparative studies are made in a simulated environment using the Grid Authorization Simulator (GAS) developed by the authors. It simulates the authorization process of the existing mechanisms like BFA, PCM, HCM and the proposed novel GAG. It also enables a comparative analysis to be done between these approaches. © 2013 Elsevier B.V. All rights reserved.
  • Item
    Grid authorization graph
    ( 2013-06-11) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun ; Buyya, Rajkumar
    The heterogeneous and dynamic nature of a grid environment demands a scalable authorization system. This brings out the need for a fast fine-grained access control mechanism for authorizing grid resources. Existing grid authorization systems adopt inefficient mechanisms for storing resources' security policies. This leads to a large number of repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM). HCM reduces the redundancy in checking security rules compared to the Brute Force Approach (BFA) as well as the Primitive Clustering Mechanism (PCM). Further enhancement is done to HCM to increase the scalability of the authorization process. However, HCM is not totally free of repetitions and cannot easily describe the OR-based security policies. A novel Grid Authorization Graph (GAG) is proposed to overcome HCM limitations. GAG introduces special types of edges named "Correspondence Edge"/"Discrepancy Edge" which can be used to entirely eliminate the redundancy and handle the cases where a set of security rules are mutually exclusive. Comparative studies are made in a simulated environment using the Grid Authorization Simulator (GAS) developed by the authors. It simulates the authorization process of the existing mechanisms like BFA, PCM, HCM and the proposed novel GAG. It also enables a comparative analysis to be done between these approaches. © 2013 Elsevier B.V. All rights reserved.
  • Item
    Grid authorization graph
    ( 2013-06-11) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun ; Buyya, Rajkumar
    The heterogeneous and dynamic nature of a grid environment demands a scalable authorization system. This brings out the need for a fast fine-grained access control mechanism for authorizing grid resources. Existing grid authorization systems adopt inefficient mechanisms for storing resources' security policies. This leads to a large number of repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM). HCM reduces the redundancy in checking security rules compared to the Brute Force Approach (BFA) as well as the Primitive Clustering Mechanism (PCM). Further enhancement is done to HCM to increase the scalability of the authorization process. However, HCM is not totally free of repetitions and cannot easily describe the OR-based security policies. A novel Grid Authorization Graph (GAG) is proposed to overcome HCM limitations. GAG introduces special types of edges named "Correspondence Edge"/"Discrepancy Edge" which can be used to entirely eliminate the redundancy and handle the cases where a set of security rules are mutually exclusive. Comparative studies are made in a simulated environment using the Grid Authorization Simulator (GAS) developed by the authors. It simulates the authorization process of the existing mechanisms like BFA, PCM, HCM and the proposed novel GAG. It also enables a comparative analysis to be done between these approaches. © 2013 Elsevier B.V. All rights reserved.
  • Item
    Secure communication and access control for mobile web service provisioning
    ( 2008-01-01) Srirama, Satish Narayana ; Naumenko, Anton
    It is now feasible to host basic web services on a smart phone due to the advances in wireless devices and mobile communication technologies. While the applications are quite welcoming, the ability to provide secure and reliable communication in the vulnerable and volatile mobile ad-hoc topologies is vastly becoming necessary. The paper mainly addresses the details and issues in providing secured communication and access control for the mobile web service provisioning domain. While the basic message-level security can be provided, providing proper access control mechanisms for the Mobile Host still poses a great challenge. This paper discusses details of secure communication and proposes the distributed semantics-based authorization mechanism. © 2008 Atilla Elçi.
  • Item
    Weighted grid authorization graph (WGAG)
    ( 2018-02-07) Namane, Sara ; Kaiiali, Mustafa ; Ghoualmi, Nacira ; Wankar, Rajeev ; Rao, C. R. ; Sezer, Sakir
    Grid is a collection of distributed computing resources. These resources are available over a local or wide area network that appears to an end user or application as one large virtual computing system. The vision is to create virtual dynamic organizations through secure and coordinated resource-sharing among individuals and institutions. Access control to these resources is a problem difficult to manage, how to store and manage the security policies of such a system plays a key role. If these policies are not properly stored, the response time to access control requests will be dramatically increased. Grid Authorization Graph (GAG) was proposed to improve the authorization efficiency by eliminating the redundancy in checking security rules. This article proposes the Weighted Grid Authorization Graph (WGAG) as an enhancement to GAG which further improves the authorization efficiency by avoiding a lots of security rule checking. Finally, as proof of concept, we implement the WGAG simulator where simulations were done. The obtained results show that the proposed model can effectively reduce the complexity of security rule checking and gave better results than GAG.
  • Item
    Weighted grid authorization graph (WGAG)
    ( 2018-02-07) Namane, Sara ; Kaiiali, Mustafa ; Ghoualmi, Nacira ; Wankar, Rajeev ; Rao, C. R. ; Sezer, Sakir
    Grid is a collection of distributed computing resources. These resources are available over a local or wide area network that appears to an end user or application as one large virtual computing system. The vision is to create virtual dynamic organizations through secure and coordinated resource-sharing among individuals and institutions. Access control to these resources is a problem difficult to manage, how to store and manage the security policies of such a system plays a key role. If these policies are not properly stored, the response time to access control requests will be dramatically increased. Grid Authorization Graph (GAG) was proposed to improve the authorization efficiency by eliminating the redundancy in checking security rules. This article proposes the Weighted Grid Authorization Graph (WGAG) as an enhancement to GAG which further improves the authorization efficiency by avoiding a lots of security rule checking. Finally, as proof of concept, we implement the WGAG simulator where simulations were done. The obtained results show that the proposed model can effectively reduce the complexity of security rule checking and gave better results than GAG.