Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgbele, Kehinde K.-
dc.contributor.authorAzeez, N. A.-
dc.contributor.authorAbidoye, A. P.-
dc.contributor.authorAdesina, A. O.-
dc.identifier.citationAzeez, N. A., Abidoye, A. P., Agbele, K. K., & Adesina, A. O. (2012). A dependable model for attaining maximum authetication security procedure in a grid based environment.en_US
dc.identifier.issnISSN 1819-3579-
dc.description.abstractGrid computing is an emergent computing innovation which offers endless access to computing infrastructure across various organizations (academia and industry). Since this technology allows aggregation of various computer systems for usage by different users to run applications, the information stored on it which may be sensitive and private, remains vulnerable. According to related research on the attribute based access control for grid computing there is no adequate and appropriate security mechanism to authorize and authenticate users before accessing information on a grid system. The issue of security in grid technology has not been fully addressed even though it is a precondition for optimizing grid usability. Having realized the paucity of security guarantees, this research work focuses on developing a model for securing data and applications deployed on a grid on the basis of double identity authentication and public key. The implementation of the model has undoubtedly guaranteed the security of sensitive information on a grid vis-a-vis strict adherence to security policies and protocols.en_US
dc.publisherTrends in Applied Sciences Researchen_US
dc.titleA Dependable Model for Attaining Maximum Authentication Security Procedure in a Grid Based Environmenten_US
Appears in Collections:Research Articles

Files in This Item:
File Description SizeFormat 
A Dependable Model for Attaining Maximum Authentication Security.pdfArticle full-text269.58 kBAdobe PDFThumbnail

Items in EUSpace are protected by copyright, with all rights reserved, unless otherwise indicated.