Abstract
Cryptographic protocols are sequences of message exchanges, usually involving encryption, intended to establish secure communication over insecure networks. Whether they actually do so is a notoriously subtle question. This paper describes a proof procedure that automatically proves desired properties of cryptographic protocols, using a HOL formalization of a “belief logic” extending that of Gong, Needham, and Yahalom [9], or precisely identifies where these proof attempts fail. This proof procedure is not a full decision procedure for the belief logic, but it proves all theorems that have been of interest. This proof procedure has quickly shown potential deficiencies in published protocols, and is a significant application for HOL90 and SML.KeywordsData ItemTime StampMessage Authentication CodeCryptographic ProtocolProof ProcedureThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
