-
-
[分享]Breaking a Remote User Authentication Scheme for Multi-Server Architecture
-
发表于: 2009-5-28 06:41 4100
-
[分享]Breaking a Remote User Authentication Scheme for Multi-Server Architecture
2009-5-28 06:41
4100
Breaking a Remote User Authentication Scheme for Multi-Server Architecture
Xiang Cao, Non-Member, IEEE, and Sheng Zhong, Non-Member, IEEE
Abstract—
Lin et al. [1] proposed a remote user authentication scheme for multi-server architecture. In this paper, we breaks this scheme by giving an attack. Our attack allows an adversary to impersonate any user in the system, as long as a single
authentication message of that user is observed.
Index Terms—Authentication, cryptanalysis, security.
I. INTRODUCTION
REMOTE user authentication is very important for computer networks and distributed systems. In [1], Lin et al. presented a new remote authentication scheme for multiserver architecture. Their scheme is based on the ElGamal
digital signature scheme and geometric transformations on an Euclidean plane. They claimed that their scheme was highly secure against various types of attacks in a multi-server environment. Unfortunately, as we will point out in this paper, Lin et al.’s scheme is not secure. More precisely, we present, in Section 3, an attack that allows an adversary to impersonate any user, after a single authentication message from that user is observed. To make our presentation clear, we first review their authentication scheme in Section 2.
Xiang Cao, Non-Member, IEEE, and Sheng Zhong, Non-Member, IEEE
Abstract—
Lin et al. [1] proposed a remote user authentication scheme for multi-server architecture. In this paper, we breaks this scheme by giving an attack. Our attack allows an adversary to impersonate any user in the system, as long as a single
authentication message of that user is observed.
Index Terms—Authentication, cryptanalysis, security.
I. INTRODUCTION
REMOTE user authentication is very important for computer networks and distributed systems. In [1], Lin et al. presented a new remote authentication scheme for multiserver architecture. Their scheme is based on the ElGamal
digital signature scheme and geometric transformations on an Euclidean plane. They claimed that their scheme was highly secure against various types of attacks in a multi-server environment. Unfortunately, as we will point out in this paper, Lin et al.’s scheme is not secure. More precisely, we present, in Section 3, an attack that allows an adversary to impersonate any user, after a single authentication message from that user is observed. To make our presentation clear, we first review their authentication scheme in Section 2.
[培训]内核驱动高级班,冲击BAT一流互联网大厂工作,每周日13:00-18:00直播授课
赞赏
他的文章
- [转帖][Cado-nfs-discuss] 795-bit factoring and discrete logarithms (RSA-240 于2019年12月2日被破解) 19498
- [转帖]How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits 8163
- [推荐]RSA-220 has 220 decimal digits (729 bits), and was factored 6895
- [推荐]RSA-210 has been factored. 11179
- Lessons Learned From Previous SSL/TLS Attacks - A Brief Chronology Of Attacks... 8923
看原图
赞赏
雪币:
留言: