Proving Secure Properties of Cryptographic Protocols with Knowledge Based Approach
This document has been relocated to http://scholarsmine.mst.edu/comsci_facwork/272
There were 6 downloads as of 28 Jun 2016.
Abstract
Cryptographic protocols have been widely used to protect communications over insecure network environments. Existing cryptographic protocols usually contain flaws. To analyze these protocols and find potential flaws in them, the secure properties of them need be studied in depth. This paper attempts to provide a new framework to analyze and prove the secure properties in these protocols. A number of predicates and action functions are used to model the network communication environment. Domain rules are given to describe the transitions of principals' knowledge and belief states. An example of public key authentication protocols has been studied and analysed.
