Skip to Main content Skip to Navigation
Conference papers

Chaotic Chebyshev Polynomials Based Remote User Authentication Scheme in Client-Server Environment

Abstract : Perfect forward secrecy is considered as the most important standard to evaluate a strong authentication scheme. There are many results researched to achieve this property without using hard problems. Recently, the result of Chang et al has some advances such as, the correctness of schemes mutual authentication and session key agreement demonstrated in BAN-logic or the overheads reduction of system implementation. However, in this paper, we prove that their scheme is still vulnerable to impersonation attacks and session key leakage. To overcome those limitations and be practical, we use different notion to propose time efficient scheme conducted in experiment. Our proposed method can be applied for remote user authentication in various scenarios, including systems with user authentication using mobile or wearable devices.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01345140
Contributor : Hal Ifip <>
Submitted on : Wednesday, July 13, 2016 - 11:12:21 AM
Last modification on : Saturday, December 16, 2017 - 6:54:03 AM

File

337885_1_En_32_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Toan-Thinh Truong, Minh-Triet Tran, Anh-Duc Duong, Isao Echizen. Chaotic Chebyshev Polynomials Based Remote User Authentication Scheme in Client-Server Environment. 30th IFIP International Information Security Conference (SEC), May 2015, Hamburg, Germany. pp.479-494, ⟨10.1007/978-3-319-18467-8_32⟩. ⟨hal-01345140⟩

Share

Metrics

Record views

160

Files downloads

237