Abstract
In 1992, Bellovin and Merritt proposed Encrypted Key Exchange (EKE) protocols for preventing dictionary attacks on weak chosen passwords. In 1995, Steiner, Tsudik, and Waidner proposed a minimal DHEKE protocol which simplified the Diffie-Hellman based one of Bellovin and Merritts' protocols. In this paper, we propose two improvements on the minimal DHEKE protocol. These two improvements can reduce the computational cost further.
Original language | English |
---|---|
Pages (from-to) | 41-47 |
Number of pages | 7 |
Journal | Operating Systems Review (ACM) |
Volume | 35 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2001 Jan |
All Science Journal Classification (ASJC) codes
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications