loading...
Efficient protocols secure against guessing and replay attacks
Las Vegas, Nevada, USA September 20-September 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCCN.1995.540108Fourth International Conference on Co ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
S. Keung, Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA
Kai-Yeung Siu, Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA
Abstract: To establish secure network communications, a common practice requires that users authenticate one another and establish a temporary session key based on their passwords. Since users often use passwords that are easy to remember, attackers can correctly guess the passwords simply by searching through a relatively small space of "weak" passwords. In this paper, we present a new set of efficient protocols that can establish secure communications while protecting passwords from any feasible guessing and replay attacks. Our protocols avoid the use of timestamps altogether and minimize the use of nonces (random numbers). We examine some common attacks to existing protocols, and show how our protocols can be secure against such attacks. Our protocols apply to both secure peer-to-peer and multicast communications.
Index Terms:
protocols; secure communications; password guessing; replay attacks; efficient protocols; password protection; nonces minimisation; peer-to-peer communication; multicast communications
Citation:
S. Keung, Kai-Yeung Siu, "Efficient protocols secure against guessing and replay attacks," icccn, pp.0105, Fourth International Conference on Computer Communications and Networks (ICCCN '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.