We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Reseach Article

Security Analysis in Hierarchical Resource Arrangements in Grid Computing

by R.Menaka, Dr.R.S.D Wahidha Banu
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 24 - Number 6
Year of Publication: 2011
Authors: R.Menaka, Dr.R.S.D Wahidha Banu
10.5120/2947-3930

R.Menaka, Dr.R.S.D Wahidha Banu . Security Analysis in Hierarchical Resource Arrangements in Grid Computing. International Journal of Computer Applications. 24, 6 ( June 2011), 34-39. DOI=10.5120/2947-3930

@article{ 10.5120/2947-3930,
author = { R.Menaka, Dr.R.S.D Wahidha Banu },
title = { Security Analysis in Hierarchical Resource Arrangements in Grid Computing },
journal = { International Journal of Computer Applications },
issue_date = { June 2011 },
volume = { 24 },
number = { 6 },
month = { June },
year = { 2011 },
issn = { 0975-8887 },
pages = { 34-39 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume24/number6/2947-3930/ },
doi = { 10.5120/2947-3930 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:10:19.094532+05:30
%A R.Menaka
%A Dr.R.S.D Wahidha Banu
%T Security Analysis in Hierarchical Resource Arrangements in Grid Computing
%J International Journal of Computer Applications
%@ 0975-8887
%V 24
%N 6
%P 34-39
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

As the days going on, desires of netizens increases to meet unforeseen emergency online demands for accessing the services, owning the resources for required period which exists in the e-pool distributively. The needs met by the on-the-fly framed infrastructure (i.e) virtual organization which assimilates the dynamic collection of diverse resources and provides the large-scale resource sharing and multi-institutional collaboration called grid computing. The prominent feature of this computing is the collaboration of manifold units to perform coordinated sharing tasks that basically rely on two functions: communication and resource sharing through the internet usage. As the Internet is not designed on strong security basis, there exist various attacks, due to malicious internal and external users. Securing grid communication and controlling access to shared resources in a fine-tuned manner are important issues for grid services. This paper is proposed to give remedial for key escrow and analysis of security attributes by mounting a secured grid infrastructure with Identity Based Cryptography.

References
  1. RajKumarBuyya, SteveChapin,and DavidDi Nucci, Architecture Models For Resource Management in the Grid.
  2. R.Sindhuja ,P.Varsha and Dr.G. Sumathi, An Improved ID-Based Entitled Verifier Crytography for Grid Systems, International Journal of Recent Trends in Engineering, Vol2, No.1 November 2009.
  3. SianiPearson,MarcoCasassa-Mont & Manny Novoa, HewleetPackard labs,SecurityInformati-on Transfer in Distributed Computing Environment, IEEE Security and Privacy 2007.
  4. CraigGentry, Alice Silverberg,Hierarchical ID-Based Crytography,ASIACRYPT 2002, LNCS 2501,pp. 548-566,2002.
  5. Jason Crampton,Hoon Wei Lim,Kenneth G.Paterson,A Certificate-Free Grid Security Infrastructure Supporting Password-Based User Authentication, In Proceedings of the 6th Annual PKI R&D Workshop 2007. NIST Interagency Report.
  6. H.W. Lim and M.J.B. Robshaw. On identity-based cryptography and GRID computing.
  7. I.Foster, C. Kesselman, G. Tsudik, and S. Tuecke. A security architecture for computational Grids. In Proceedings of the 5th ACM Computer and Communications Security Conference, pages 83–92. ACM Press, 1998.
  8. Changyu Dong, Jpair: A Quick Introduction Oct.2010
  9. Anoop MS, Elliptic Curve Cryptography, An Implementation Guide.
  10. Certicom, Standards for Efficient Cryptography, SEC 1: Elliptic Curve Cryptography,Version 1.0, September 2000, Available at http://www.secg.org/ download /aid385/sec1_final.pdf.
  11. P. Barreto, H. Kim, B. Lynn, and M. Scott. Efficient Algorithms for Pairing-Based Cryptosystems. In CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 47{53. Springer Verlag, 2002.
  12. Byoungcheon Lee, Colin Boyd et.al , Secure Key Issuing in ID-based Crytography. In Australasian Information Security Workshop 2004
  13. AISW 2004.
  14. D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. Adv. in Cryptology | Crypto 2001, LNCS vol. 2139, Springer-Verlag, pp. 213{229, 2001. Full version to appear in SIAM J. Computing and available at http://eprint.iacr.org/2001/090.
  15. M. Naor and M. Yung. Universal One-Way Hash functions and Their Cryptographic Applications. 21st ACM Symposium on Theory of Computing (STOC), ACM, pp. 33{43, 1989.
  16. M.H. Au, J.K. Liu, T.H. Yuen, and D. S. Wong.(2006) Practical Hierarchical Identity Based Encryption and Signature schemes Without Random Oracles. http://eprint.iacr.org/2006/368
Index Terms

Computer Science
Information Sciences

Keywords

Discrete logarithms Bilinearpairing Private Key Generator Single sign on Delegation