A new two-round certificateless authenticated key agreement protocol without bilinear pairings

Certificateless public key cryptography (CLPKC), which can simplify the complex certificate management in the traditional public key cryptography and resolve the key escrow problem in identity-based cryptography, has been widely studied. As an important part of CLPKC, certificateless two-party authe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical and computer modelling Jg. 54; H. 11; S. 3143 - 3152
Hauptverfasser: He, Debiao, Chen, Yitao, Chen, Jianhua, Zhang, Rui, Han, Weiwei
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Kidlington Elsevier Ltd 01.12.2011
Elsevier
Schlagworte:
Algebra
Algebraic geometry
Authenticated key agreement
Bilinear pairings
Certificateless cryptography
computer techniques
decision making
Elliptic curve
Exact sciences and technology
Mathematical analysis
mathematical models
Mathematics
Methods of scientific computing (including symbolic computation, algebraic computation)
Number theory
Numerical analysis. Scientific computation
Provable security
Sciences and techniques of general use
Certificateless cryptography
Provable security
Elliptic curve
Authenticated key agreement
Bilinear pairings
Multiplication
Applied mathematics
Cryptography
Mathematical model
Oracle
Computer aided analysis
ISSN:0895-7177, 1872-9479
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Certificateless public key cryptography (CLPKC), which can simplify the complex certificate management in the traditional public key cryptography and resolve the key escrow problem in identity-based cryptography, has been widely studied. As an important part of CLPKC, certificateless two-party authenticated key agreement (CTAKA) protocols have also received considerable attention. Recently, many CTAKA protocols 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. To improve the performance, several CTAKA protocols without pairings have been proposed. In this paper, we will show a latest CTAKA protocol is not secure against a type 1 adversary. To improve the security and performance, we also propose a new CTAKA protocol without pairing. At last, we show the proposed protocol is secure under the random oracle model.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0895-7177
1872-9479
DOI:10.1016/j.mcm.2011.08.004