New efficient user identification and key distribution scheme providing enhanced security

Yang, Yanjiang; Wang, Shuhong; Bao, Feng; Wang, Jie; Deng, Robert H.

doi:10.1016/j.cose.2004.08.005

Cited by 55 publications

(96 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One is only for a single server environment and the other is suitable for a multi-server environment. Compared with our proposed multi-server scheme and Yang et al's scheme [21], our scheme is more efficient since our scheme only uses the symmetric cryptosystems and hashing functions. Our proposed schemes satisfy all above five criteria.…”

Section: C4 Mutual Authenticationmentioning

confidence: 99%

“…al. [21] proposed user identification and key distribution scheme with the ability of privacy protection but we point out it is less efficient because of using public-key cryptosystems.…”

Section: Introductionmentioning

confidence: 99%

“…Only passing a password for authenticating between the user and the server is not enough, since it is less safety and is easily tapped by the adversary. Before two parties can do secure communication, a session key is needed for protecting subsequence communications [1,8,9,21]. Also, using smart cards [8,9,21], remote user authentication and key agreement can be simplified, flexible and efficient for creating a secure distributed computers environment.…”

Section: Introductionmentioning

confidence: 99%

“…Also, using smart cards [8,9,21], remote user authentication and key agreement can be simplified, flexible and efficient for creating a secure distributed computers environment. It is also useful for providing identity privacy for the users [21]. In 2004, Juang proposed two efficient authentication and key agreement schemes [8,9] for single server, and multiserver environments.…”

Section: Introductionmentioning

confidence: 99%

“…For basically security and efficient requirements, the following criteria are important for remote user authentication and key agreement schemes with smart cards [8,9,21].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient User Authentication and Key Agreement in Wireless Sensor Networks

Juang

Information Security Applications

View full text Add to dashboard Cite

Using smart cards, remote user authentication and key agreement can be simplified, flexible, and efficient for creating a secure distributed computers environment. Addition to user authentication and key distribution, it is very useful for providing identity privacy for users. In this paper, we propose novel user authentication and key agreement schemes with privacy protection. We first propose a single-server scheme and then apply this scheme to a multi-server environment. The main merits include: (1) the privacy of users can be ensured; (2) a user can freely choose his own password; (3) the computation and communication cost is very low; (4) servers and users can authenticate each other; (5) it generates a session key agreed by the server and the user; (6) our proposed schemes are nonce-based schemes which does not have a serious timesynchronization problem.

show abstract

Section: C4 Mutual Authenticationmentioning

confidence: 99%

“…al. [21] proposed user identification and key distribution scheme with the ability of privacy protection but we point out it is less efficient because of using public-key cryptosystems.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…For basically security and efficient requirements, the following criteria are important for remote user authentication and key agreement schemes with smart cards [8,9,21].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient User Authentication and Key Agreement in Wireless Sensor Networks

Juang

Information Security Applications

View full text Add to dashboard Cite

show abstract

Cryptanalysis of some user identification schemes for distributed computer networks

Liu

Horng

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYUser identification plays an important role for access control in networks. Recently, Hsu and Chuang proposed a user identification scheme for distributed computer networks, which can also provide key agreement and user anonymity. However, Tsai pointed out the weakness of Hsu–Chuang's scheme and proposed an improved scheme. In this paper, we present two attacks to examine that some user identification schemes have a serious security loophole. Finally, we propose a new user identification scheme, which is more secure than the existing schemes.Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

A secure and efficient ECC‐based user anonymity preserving single sign‐on scheme for distributed computer networks

Odelu

Das

Goswami

2014

Security Comm Networks

View full text Add to dashboard Cite

A user authentication in the distributed computer networks (DCNs) plays a crucial rule to verify whether the user is a legal user and can therefore be granted access to the requested services to that user. In recent years, several RSA‐based single sign‐on mechanisms have been proposed in DCNs. However, most of them cannot preserve the user anonymity when possible attacks occur. The user devices are usually battery limited (e.g., cellular phones) and the elliptic‐curve cryptosystem is much efficient than RSA cryptosystem for the battery‐limited devices. In this paper, we aim to propose a new secure elliptic‐curve cryptosystem‐based single sign‐on mechanism for user authentication and key establishment for the secure communications in a DCNs using biometric‐based smart card. In our scheme, a user only needs to remember a private password and his or her selected unique identity to authenticate and agree on a high‐entropy cryptographic one‐time session key with a provider to communicate over untrusted public networks. Through formal and informal security analysis, we show that our scheme prevents other known possible attacks. In addition, we perform simulation on our scheme for the formal security verification using the widely‐accepted Automated Validation of Internet Security Protocols and Applications tool. The simulation results ensure that our scheme is secure against replay and man‐in‐the‐middle attacks. Furthermore, our scheme provides high security along with lower computational cost and communication cost, and as a result, our scheme is much suitable for the battery‐limited devices as compared to other related RSA‐based schemes. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

New efficient user identification and key distribution scheme providing enhanced security

Cited by 55 publications

References 5 publications

Efficient User Authentication and Key Agreement in Wireless Sensor Networks

Efficient User Authentication and Key Agreement in Wireless Sensor Networks

Cryptanalysis of some user identification schemes for distributed computer networks

A secure and efficient ECC‐based user anonymity preserving single sign‐on scheme for distributed computer networks

Contact Info

Product

Resources

About