A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

Cao, Xiaofeng; Kou, Weidong; Du, Xiaoni

doi:10.1016/j.ins.2010.04.002

Cited by 233 publications

(141 citation statements)

References 20 publications

Supporting

Mentioning

140

Contrasting

Unclassified

Order By: Relevance

“…Theoretical analyses (Chen et al 2007) and experimental results (Cao and Kou 2010) (He et al 2011a, 2012b demonstrate that the computation costs of a bilinear pairing operation, a modular exponentiation operation and a bilinear pairing-based scale multiplication operation are about 19, 3 and 3 times of that of a ECCbased scale multiplication operation. Therefore, we could get that the computational cost of the Sign algorithm in the proposed scheme is 60%, 54.55% and 10.71% of that in Sun et al's CLBS scheme (Sun and (Zhang et al 2011) separately.…”

Section: Performance Analysesmentioning

confidence: 99%

“…However, the bilinear pairing operation is very complicated. Theoretical analysis (Chen et al 2007) (Hankerson et al 2004) and experimental results (Cao and Kou 2010) (He et al 2011a(He et al , 2012b demonstrate that the computation cost of a bilinear pairing operation is similar to that of a dozen or so elliptic curve scalar multiplication operations. Therefore, the performance of those CLBS schemes is not very satisfactory and CLBS scheme without bilinear pairing is required for practical applications.…”

mentioning

confidence: 99%

See 1 more Smart Citation

An efficient certificateless blind signature scheme without bilinear pairing

Dong¹,

Gao²,

Shi

et al. 2014

An. Acad. Bras. Ciênc.

View full text Add to dashboard Cite

Recently, the certificateless public key cryptography (CLPKC) has been studied widely since it could solve both of the certificate management problem in traditional public key cryptography (TPKC) and the key escrow problem in the identity-based public key cryptography (ID-based PKC). To satisfy requirements of different applications, many certificateless blind signature (CLBS) schemes using bilinear pairing for the CLPKC setting have been proposed. However, the bilinear pairing operation is very complicated. Therefore, the performance of those CLBS schemes is not very satisfactory. To solve the problem, we propose an efficient CLBS scheme without bilinear pairing. Performance analysis shows that the proposed scheme could reduce costs of computation and storage. Security analysis shows the proposed scheme is provably secure against both of two types of adversaries.

show abstract

Section: Performance Analysesmentioning

confidence: 99%

mentioning

confidence: 99%

An efficient certificateless blind signature scheme without bilinear pairing

Dong¹,

Gao²,

Shi

et al. 2014

An. Acad. Bras. Ciênc.

View full text Add to dashboard Cite

show abstract

“…[4]. In 1984 Shamir proposed the concept of ID-Based Cryptography (IBC) to remove the authentication, communication, and protection of public key certificates [2]. Hankerson et al [5], presented Background of Elliptic Curve Cryptography (ECC) and its techniques.…”

Section: Introductionmentioning

confidence: 99%

A Study of Pairing-Free Identity-Based Mutual Authenticated Protocol for Cloud Computing

Kumar¹,

Ahmad²,

Kumari³

et al. 2017

IJERA

View full text Add to dashboard Cite

Many companies start to provide various kinds of cloud computing services for internet users at the same time these services also bring several security issues. Currently the greater part of cloud computing systems provides digital identity for users to get access to their services. Presently, most of the cloud computing system use asymmetric and conventional public key cryptography to give mutual authentication data security. Pairing-free identity based cryptography has some pull characteristics that give the impression to fit find the requirements of cloud computing. The proposed protocol accomplishes in three phases such as initialization phase, registration phase and mutual authentication and session key agreement phase. Detailed security analyses have been made to authenticate cloud server and user. Further, the paper has resistance to possible attacks in cloud computing.

show abstract

“…The DiffieHellman protocol (DIFFIE;HELLMAN, 1976) is the first key exchange protocol based on asymmetric cryptography. Since that event, many key exchange protocols (CAO; KOU, 2011;CHEN et al, 2007;HE et al, 2011a and c;HE, 2012;HE et al, 2012a and b) have been proposed to satisfy the application´s requirement.…”

Section: Introductionmentioning

confidence: 99%

“…Thus, the user cannot claim that the authentication Although the elliptic curve pairings are used in the above ID-based AMKE protocol (TAN, 2011), the pairing is still regarded as an expensive cryptography primitive. The relative computation cost of a pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group (CAO; KOU, 2011;CHEN et al, 2007). Therefore, ID-based AMKE protocol without bilinear pairing would be more appealing in terms of efficiency.…”

Section: Introductionmentioning

confidence: 99%

<b>Efficient identity-based authenticated multiple key exchange protocol</b> - doi: 10.4025/actascitechnol.v35i4.16434

Chen

Han

2013

Acta Sci. Technol.

View full text Add to dashboard Cite

ABSTRACT. Authenticated multiple key exchange (AMKE) protocols not only allow participants to warrant multiple session keys within one run of the protocol but also ensure the authenticity of the other party. Many AMKE protocols using bilinear pairings have been proposed. However, 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, an ID-based AMKE protocol without bilinear pairing is proposed. Since the running time is largely saved, suggested protocol is more practical than the previous related protocols for practical applications.Keywords: ID-based, authenticated multiple key exchange, elliptic curve, bilinear pairing, random oracle.Protocolo eficiente de troca autenticada entre múltiplas chaves com base em indentidade RESUMO. Os protocolos de troca autenticada entre múltiplas chaves (TAMC) não só permitem que os participantes concordem com o uso de várias chaves de sessão aquando duma execução da sessão através de um único protocolo mas também assegura a autenticidade da outra parte. Muitos dos protocolos TAMC que utilizam emparelhamentos bilineares têm sido propostos. Contudo, os custos relativos de computação do emparalheamento é aproximadamente vinte vezes superior aos de multiplicação escalar sobre o grupo de curva elíptica. De modo a melhorar o desempenho, nós propomos um protocoloTAMC com base em IDs destituído de emparelhamentos bilineares. Com o tempo de execução a ser econonomizado de forma elevada, o nosso protocolo é mais prático do que outros protocolos de objectivo de aplicação prática.Palavras-chave: Base em IDs, troca autenticada entre múltiplas chaves, curva elíptica, emparelhamento bilinear, oráculo aleatório.

show abstract

A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

Cited by 233 publications

References 20 publications

An efficient certificateless blind signature scheme without bilinear pairing

An efficient certificateless blind signature scheme without bilinear pairing

A Study of Pairing-Free Identity-Based Mutual Authenticated Protocol for Cloud Computing

<b>Efficient identity-based authenticated multiple key exchange protocol</b> - doi: 10.4025/actascitechnol.v35i4.16434

Contact Info

Product

Resources

About