An efficient and provable secure PAKE scheme with robust anonymity

Authors:
Cong Liu;Chuan-gui Ma
Affiliations:
Zhengzhou Information Science and Technology Institute, Zhengzhou, Henan Province, China;Zhengzhou Information Science and Technology Institute, Zhengzhou, Henan Province, China
Venue:
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Year:
2012

Citing 5
Cited 0

A New Anonymous Password-Based Authenticated Key Exchange Protocol

INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions

AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Authenticated key exchange secure against dictionary attacks

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A secure threshold anonymous password-authenticated key exchange protocol

IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Provable secure authentication protocol with anonymity for roaming service in global mobility networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 2009, Sun et al. proposed an improved anonymous scheme on Juang et al.'s password-authenticated key exchange (PAKE) sheme using smart cards. Although, this scheme overcomes some weaknesses of Juang et al.'s scheme and achieves user anonymity, it is still lack of the untraceability property such that the third party over the communication channel can recognize whether or not the same user in different sessions. In this paper, we propose a new robust anonymous PAKE scheme using smart cards which not only can strengthen the security of Sun et al.'s scheme by addressing untraceability, but also can achieve greater communication efficiency. Moreover, we present a strict security proof for our scheme.