Reference : Verification of two versions of the challenge handshake authentication protocol (CHAP)
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/23844
Verification of two versions of the challenge handshake authentication protocol (CHAP)
English
Leduc, Guy mailto [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Jan-2000
Annales des Télécommunications
Springer
55
1-2
20-30
Yes (verified by ORBi)
International
0003-4347
[en] The challenge handshake authentication protocol, CHAP, is an authentication protocol intended for use primarily by hosts and routers that connect to a network server I in switched circuits or dial-up lines. but might be applied to dedicated links as well. In this paper; we specify two versions of the protocol, using the formal language Lotos, and apply the Eucalyptus model-based verification tools to prove that the first version has a flaw: whereas the second one is robust to passive and active attacks. The paper is written bl a tutorial fashion with a strong emphasis oil the methodology used. The relative simplicity of the CHAP protocol allows one to include complete Lotos specifications and definitions of properties, so that the experiment can be reproduced easily.
Researchers ; Professionals ; Students
http://hdl.handle.net/2268/23844

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
RUN-PP00-01.pdfAuthor postprint318.43 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.