Transport Level Security: a proof using the Gong-Needham-Yahalom Logic

Simple item page
dc.creatorEaves, Walter
dc.date1999-04-14
dc.date.accessioned2026-07-07T03:24:04Z
dc.date.available2026-07-07T03:24:04Z
dc.descriptionThis paper provides a proof of the proposed Internet standard Transport Level Security protocol using the Gong-Needham-Yahalom logic. It is intended as a teaching aid and hopes to show to students: the potency of a formal method for protocol design; some of the subtleties of authenticating parties on a network where all messages can be intercepted; the design of what should be a widely accepted standard.
dc.description22 pages, 2 figures, 1 appendix
dc.identifierhttps://arxiv.org/abs/cs/9904005
dc.identifierhttp://arxiv.org/abs/cs/9904005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33183
dc.subjectCryptography and Security
dc.subjectC.2.0; C.2.2; E.4; F.4.3
dc.titleTransport Level Security: a proof using the Gong-Needham-Yahalom Logic
dc.typetext

Files

Collections

arXiv