Recently, Tseng et al. proposed a novel key agreement protocol based on chaotic maps. They claimed that the protocol achieved session key agreement between a server and a user, and allowed the user to anonymously interact with the server. This paper, however, will demonstrate that Tseng et al.'s pro
β¦ LIBER β¦
Security improvement on an anonymous key agreement protocol based on chaotic maps
β Scribed by Kaiping Xue; Peilin Hong
- Book ID
- 113547144
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 515 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1007-5704
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An anonymous key agreement protocol base
β
Yujun Niu; Xingyuan Wang
π
Article
π
2011
π
Elsevier Science
π
English
β 192 KB
Efficiency and security problems of anon
β
Eun-Jun Yoon
π
Article
π
2012
π
Elsevier Science
π
English
β 609 KB
A security-enhanced key agreement protoc
β
Tzung-Her Chen; Bing-Jian Wang; Tai-Yuan Tu; Chih-Hung Wang
π
Article
π
2012
π
John Wiley and Sons
π
English
β 383 KB
An extended chaotic maps-based key agree
β
Cheng-Chi Lee, Chin-Ling Chen, Chia-Ying Wu, Shiow-Yuan Huang
π
Article
π
2011
π
Springer Netherlands
π
English
β 599 KB
Cryptanalysis and improvement of an exte
β
Debiao He, Yitao Chen, Jianhua Chen
π
Article
π
2012
π
Springer Netherlands
π
English
β 420 KB
An efficient and secure DiffieβHellman k
β
Eun-Jun Yoon; Il-Soo Jeon
π
Article
π
2011
π
Elsevier Science
π
English
β 505 KB
This paper proposes a new efficient and secure Diffie-Hellman key agreement protocol based on Chebyshev chaotic map. The proposed key agreement protocol uses the semigroup property of Chebyshev polynomials to agree Diffie-Hellman based session key. The proposed protocol provides strong security comp