Referenced Items are not available for this document.
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.
Published in:
Networking and Digital Society, 2009. ICNDS '09. International Conference on
(Volume:1
)
Date of Conference: 30-31 May 2009
- Page(s):
- 227 - 230
- Print ISBN:
- 978-0-7695-3635-4
- INSPEC Accession Number:
- 10748120
- Conference Location :
- Guiyang, Guizhou
- Digital Object Identifier :
- 10.1109/ICNDS.2009.62
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
