Abstract
In this paper, we propose a new authentication and key distribution protocol which is adaptable and reliable for communication networks. The secrets for authentication, which are chosen from a relatively small space by common users, are easy to guess. Our protocol gives a solution to protect the weak secrets from guessing attacks. Compared with other related work, our protocol is more reliable because it is resistant to various kinds of attacks including guessing attacks, and more adaptable because it reduces several overheads which make the existing protocols more expensive. We show how to apply our protocol to the Q.931 calling sequences and to the World Wide Web model.
| Original language | English |
|---|---|
| Pages (from-to) | 737-744 |
| Number of pages | 8 |
| Journal | Proceedings - IEEE INFOCOM |
| Volume | 2 |
| Publication status | Published - 1997 |
| Event | Proceedings of the 1997 16th IEEE Annual Conference on Computer Communications, INFOCOM. Part 1 (of 3) - Kobe, Jpn Duration: 1997 Apr 7 → 1997 Apr 12 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Electrical and Electronic Engineering