An efficient certificateless two-party authenticated key agreement protocol (original) (raw)
Related papers
A pairing-free certificateless authenticated key agreement protocol
International Journal of Communication Systems, 2012
Due to avoiding the key escrow problem in the identity-based cryptosystem, certificateless public key cryptosystem (CLPKC) has received a significant attention. As an important part of the CLPKC, the certificateless authenticated key agreement (CLAKA) protocol also received considerable attention. Most CLAKA protocols are built from bilinear mappings on elliptic curves which need costly operations. To improve the performance, several pairing-free CLAKA protocols have been proposed. In this paper we propose a new pairing-free CLAKA protocol. Compared with the related protocols our protocol has better performance. We also show our protocol is provably secure in a very strong security model, i.e. the extended Canetti-Krawczyk (eCK) model.
An efficient certificateless authenticated key agreement scheme
IACR Cryptology ePrint Archive, 2011
Due to avoiding the key escrow problem in the identity-based cryptosystem, certificateless public key cryptosystem (CLPKC) has received a significant attention. As an important part of the CLPKC, the certificateless authenticated key agreement (CLAKA) protocol also received considerable attention. Most CLAKA protocols are built from bilinear mappings on elliptic curves which need costly operations. To improve the performance, several pairing-free CLAKA protocols have been proposed. In this paper we propose a new pairing-free CLAKA protocol. Compared with the related protocols our protocol has better performance. We also show our protocol is provably secure in a very strong security model, i.e. the extended Canetti-Krawczyk (eCK) model.
A Pairing-free Certificateless Authenticated Key Agreement Protocol in the eCK Model
2011
Many certificateless two-party authenticated key agreement schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group In order to improve the performance we propose a certificateless two-party authenticated key agreement scheme without bilinear pairings in this paper. A security proof under random oracle model is also provided.
Advances in Intelligent Systems and Computing, 2015
The continuous progress of wireless communication technology provides intelligent and efficient transportation system through Vehicular Ad-hoc Networks (VANETS) to mitigate traffic jams and road fatalities, which improves safety of passengers and traffic flow. Many researchers, vehicle manufacturers and telecommunication industries are working on VANETS to construct next generation transport system. In VANETS, vehicles, equipped with wireless devices, exchanges the traffic related information with other vehicles and the fixed Road Side Units (RSUs). The information shared between vehicles and RSUs in VANETS must be secure. For secure communications in VANETS, many cryptographic schemes were proposed in different settings and most of the schemes are using bilinear pairings over elliptic curves. But the computation of a bilinear pairing is very expensive. Also the verification of signatures/messages sent by vehicles increases the computational workload on RSUs. In order to improve computational efficiency and transmission overhead, in this paper, we present an efficient pairing-free certificateless authentication scheme with batch verification for VANETS. We designed the scheme in pairing free environment which improves the communication and computational efficiency. The proposed scheme supports batch verification, which significantly reduces the computational workload on RSUs in VANETS. The proposed scheme is proven secure in the random oracle model and meets the security requirements such as authenticity, integrity, traceability, anonymity, revocation. We compared our scheme with well known existing schemes and efficiency analysis shows that the proposed scheme is more efficient. INDEX TERMS Authentication, batch verification, digital signature, elliptic curve discrete logarithm problem, intelligent transportation system, vehicular ad hoc networks.
New secure identity-based and certificateless authenticated Key Agreement protocols without pairings
2014 International Symposium on Biometrics and Security Technologies (ISBAST), 2014
Recently, various pairing-based and pairing-free two party Key Agreement protocols in the context of Identity-Based and Certificateless cryptosystems have been published. The pairing-free Key Agreement protocols could improve the efficiency by eliminating the high expense of pairing maps. In this paper, we proposed several secure and efficient Identity-Based and Certificateless pairing-free two party Key Agreement protocols. In compare with related works, our protocols require less computational cost.
A Secure and Efficient Key Agreement Protocol Based on Certificateless Cryptography
International Journal of Intelligent Computing Research, 2012
Almost all the certificateless two-party authenticated key agreement (CTAKA) protocols found in the literature, suffer either serious security problems or inefficient performance that involves high computational costs. In this paper, we design a secure and efficient CTAKA protocol. Within the proposed CTAKA protocol, the KGC publishes the public keys of the users in a public directory (LDAP server) that has a certificate to prove its identity to the users. The LDAP certificate is the only existing certificate within the scheme. Both the two communicating parties are able to compute a common secret per session key using a secure generated random number. The protocol is fully secure against type 1 attack and fully secure against type 2 attacks under the assumptions that the KGC is an honest party and each party within the network has the full capability to keep its secret values safe. Moreover, the setup of the protocol does not include pairings and the whole key agreement process requires only four point scalar multiplications, two point additions, one hash function evaluation and one message exchange.
Simulatable certificateless two-party authenticated key agreement protocol
Information Sciences, 2010
Key agreement (KA) allows two or more users to negotiate a secret session key among them over an open network. Authenticated key agreement (AKA) is a KA protocol enhanced to prevent active attacks. AKA can be achieved using a public key infrastructure (PKI) or identity-based cryptography. However, the former suffers from a heavy certificate management burden while the latter is subject to the socalled key escrow problem. Recently, certificateless cryptography was introduced to mitigate these limitations. In this paper, we first propose a security model for AKA protocols using certificateless cryptography. Following this model, we then propose a simulatable certificateless two-party AKA protocol. Security is proven under the standard computational Diffie-Hellman (CDH) and bilinear Diffie-Hellman (BDH) assumptions. Our protocol is efficient and practical, because it requires only one pairing operation and five multiplications by each party.
A Certificateless Multiple-key Agreement Protocol without Hash Functions Based on Bilinear Pairings
Certificateless cryptosystems were proposed by Al-Riyami and Paterson in 2003 [1] to solve problems of public key cryptosystems based on PKI and based on identity. Up to now, various types of certificateless cryptographic primitives as encryption functions, signature schemes, key agreement protocols and etc, have been designed. But to the best of our knowledge, multiple-key agreement protocols have not been proposed based on certificateless cryptosystem yet. So in this paper we propose a certificateless authenticated multiple-key agreement protocol with bilinear pairings.
Multimedia Tools and Applications, 2015
The authenticated key agreement (AKA) protocol is an important cryptographic mechanism, which allows two users to establish a session key for future communication. Recently, the certificateless public key cryptography received wide attention since it could solve the certificate management problem in the traditional public key cryptography and solve the key escrow problem in the identity-based public key cryptography. In this paper, we present a strongly secure certificateless authenticated key agreement (CLAKA) protocol without pairing suitable for smart media and mobile environments, which is provably secure in the extended Canetti-Krawczyk (eCK) model and is secure as long as each party has at least one uncompromised secret. Compared with previous CLAKA protocols, our protocol has advantages over them in security or efficiency.
Provably secure and efficient certificateless authenticated tripartite key agreement protocol
Mathematical and Computer Modelling - MATH COMPUT MODELLING
Authenticated key agreement (AKA) protocols are multi-party protocols in which entities exchange public information allowing them to create a common secret key that is known only to those entities over an open network. Recently, in order to circumvent the key escrow problem inherent to ID-based cryptography and the certificate management burden in traditional public key infrastructure, the notion of certificateless public key cryptography (CL-PKC) was introduced. In this paper, we first present a security model for certificateless AKA protocols for three parties, and then propose an efficient construction based on bilinear pairings. The security of the proposed scheme can be proved to be equivalent to the computational Diffie–Hellman problem in the random oracle model.