The Analysis Of Protocols Based On Petri Nets

It is a hard problem to analyze cryptographic protocol in the area of computer network security. From 1970s, using formal methods to analyze cryptographic protocols remains the key issue in the field of computer security. There have been many effective methods, such as Ban logic, CSP, strand spaces, Paulson's inductive set of rules, and Petri nets methods, etc. Because of its compactness, fineness and unambiguity, formal analysis of cryptographic protocol has been an efficient and correct method step by step. The dissertation mainly discusses using formal methods for evaluation of cryptographic protocols based on Colored Petri Net(CPN), The main results that the author obtained are as follows:(1) The thesis reviews normal cryptographic protocols and sets forth the merits and disadvantages of each.(2) The author introduces a way to describe cryptographic protocol based on Colored Petri Net, meanwhile ,the concrete steps using CPN is expounded.(3) Analyze three cryptographic protocols with CPN and summarize a type of attack of cryptographic protocols.