An efficient user identification scheme based on ID-based cryptosystem

Hwang, Min‐Shiang; Lo, Jung-Wen; Lin, Shuw-Guann

doi:10.1016/j.csi.2004.03.006

Cited by 29 publications

(43 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tseng and Jan also used the squaring method and Jacobi symbol to generate each user's secret key corresponding to the identification. However, Hwang et al [4] pointed out that Tseng and Jan's user identification scheme needed too many communications between users, which was not suitable for the wireless environments because the battery capacity of a mobile device is limited. Therefore, Hwang et al proposed an efficient ID-based user identification scheme for the wireless environment.…”

Section: Introductionmentioning

confidence: 97%

See 1 more Smart Citation

An efficient ID-based user identification scheme for mutual authentication in mobile environments

Chang

Yang

2006

Journal of Discrete Mathematical Sciences and Cryptography

View full text Add to dashboard Cite

In mobile environments, user identification is an important application. Therefore, how to design a secure and efficient user identification scheme is an interesting and vital research. In 2004, Hwang et al proposed an ID-Based user identification scheme for mobile environments. However, their scheme is not secure because it cannot defend on the replay attack. In addition, their scheme cannot accomplish the requirement of mutual authentication because the computation load on the mobile device is too heavy. Therefore, in this paper, we improve Hwang et al's scheme to defend on the replay attack. Moreover, we further propose an efficient ID-based user identification for mutual authentication scheme in the mobile environments.

show abstract

Section: Introductionmentioning

confidence: 97%

“…However, Shamir only proposed an ID-based signature scheme, and he issued two open problems to find an ID-based cryptosystem and an ID-based public key distribution scheme in his paper. Since then, many related schemes have been proposed [3,4,5,7,12]. All these schemes have a common feature.…”

Section: Introductionmentioning

confidence: 99%

An efficient ID-based user identification scheme for mutual authentication in mobile environments

Chang

Yang

2006

Journal of Discrete Mathematical Sciences and Cryptography

View full text Add to dashboard Cite

show abstract

“…After 2004 several IDbased cryptosystems [9,12,[15][16][17][18] have been proposed. But in these schemes, the public key of each entity is not only an identity, but also some random number selected either by the entity or by the trusted authority.…”

Section: Introductionmentioning

confidence: 99%

An ID-based cryptographic mechanisms based on GDLP and IFP

Meshram¹,

Meshram

Zhang

2012

Information Processing Letters

View full text Add to dashboard Cite

“…In 2004, Wei Bin lee & Kuan Chieh Liao [13] design a transformation process that can transfer all of the discrete logarithm based cryptosystems into the ID-based systems rather than reinvent a new system .After 2004 Several IDBased cryptosystems [21,22,23,24,25,26] have been proposed. But in these schemes, the public key of each entity is not only an identity, but also some random number selected either by the entity or by the trusted authority.…”

Section: Introductionmentioning

confidence: 99%

Some Modification in ID-Based Public key Cryptosystem using IFP and DDLP

Meshram¹,

Meshram²

2011

IJACSA

View full text Add to dashboard Cite

Abstract-In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify him self before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the "identity" of his communication partner and the public key of the KAC. There is no public file required in this system. However, Shamir did not succeed in constructing an identity based cryptosystem, but only in constructing an identity-based signature scheme. Meshram and Agrawal [5] have proposed an id -based cryptosystem based on integer factoring and double discrete logarithm problem which uses the public key cryptosystem based on integer factoring and double discrete logarithm problem. In this paper, we propose the modification in an id based cryptosystem based on the integer factoring and double discrete logarithm problem and we consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system.

show abstract

An efficient user identification scheme based on ID-based cryptosystem

Cited by 29 publications

References 3 publications

An efficient ID-based user identification scheme for mutual authentication in mobile environments

An efficient ID-based user identification scheme for mutual authentication in mobile environments

An ID-based cryptographic mechanisms based on GDLP and IFP

Some Modification in ID-Based Public key Cryptosystem using IFP and DDLP

Contact Info

Product

Resources

About