Skip to Main Content
Colored Petri Nets (CPN) are a well known formalism for modeling concurrency. We extend a version of CPN method for analyzing cryptographic protocols. By establishing modeling and analysis techniques of CPN, it can be verified whether any security threats exist when many instances of the protocol are executed concurrently. Our method contributes greatly to understanding of the concurrent security of cryptographic protocols, along with construction of concurrent protocols and proof of security.