Protocol Cryptography Problem 1 Security Model 2 Security Weakness

The predominant grid authentication mech anisms use public key infrastructure (PKI). Nonetheless, certificate-less public key cryptography (CL -PKC) has several advantages that seem to well align withthe demands of grid computing. Security and efficiency are the main objectives of grid authentication protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear pairing, that is extremely computational expensive. In this paper, weanalyze the recently secure certificateless key agreement protocols without pairing. We then propose anovel grid pairing-free certificate-less two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key management approach forgrid users. We also show, a GPC-AKA security protocol proof using formal automated security analysisSycther tool.

[1]  Colin Boyd,et al.  Strongly Secure Certificateless Key Agreement , 2009, Pairing.

[2]  Futai Zhang,et al.  Provably Secure Certificateless Two-Party Authenticated Key Agreement Protocol without Pairing , 2009, 2009 International Conference on Computational Intelligence and Security.

[3]  Benedikt Schmidt,et al.  Formal analysis of key exchange protocols and physical protocols , 2012 .

[4]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1993, IEEE Trans. Inf. Theory.

[5]  Guomin Yang,et al.  Strongly secure certificateless key exchange without pairing , 2011, ASIACCS '11.

[6]  Sahadeo Padhye,et al.  An efficient certificateless two-party authenticated key agreement protocol , 2012, Comput. Math. Appl..

[7]  Mohsin Hashim,et al.  Fully-secure and efficient pairing-free certificateless authenticated key agreement protocol , 2012, World Congress on Internet Security (WorldCIS-2012).

[8]  Sahadeo Padhye,et al.  A pairing‐free certificateless authenticated key agreement protocol , 2012, Int. J. Commun. Syst..

[9]  David A. Basin,et al.  Modeling and Analyzing Security in the Presence of Compromising Adversaries , 2010, ESORICS.

[10]  Amr Farouk,et al.  Authentication mechanisms in grid computing environment: Comparative study , 2012, 2012 International Conference on Engineering and Technology (ICET).

[11]  Colleen M. Swanson,et al.  Security in Key Agreement: Two-Party Certificateless Schemes , 2008 .

[12]  Rui Zhang,et al.  A new two-round certificateless authenticated key agreement protocol without bilinear pairings , 2011, Mathematical and computer modelling.

[13]  Kenneth G. Paterson,et al.  Certificateless Public Key Cryptography , 2003 .

[14]  Zhenfu Cao,et al.  Efficient Certificateless Authentication and Key Agreement (CL-AK) for Grid Computing , 2008, Int. J. Netw. Secur..

[15]  B. Soh,et al.  Applications of Pairings in GRID Security , 2006, 2006 1st International Conference on Communication Systems Software & Middleware.

[16]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.

[17]  Qiuliang Xu,et al.  A Two-party certificateless authenticated key agreement protocol without pairing , 2009, 2009 2nd IEEE International Conference on Computer Science and Information Technology.