VERIFICATION OF KEY MANAGEMENT CRYPTOGRAPHIC PROTOCOLS WITH COLORED PETRI NETS
The possibility of using colored Petri nets for the analysis of key distribution cryptographic protocols as an example of symmetric Needham—Schroeder protocol is reviewed and evaluated.
Saved in:
Main Authors: | Nadezhda S. Mogilevskaya, Sergey S. Kolchanov |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Don State Technical University
2011-11-01
|
Series: | Advanced Engineering Research |
Subjects: | |
Online Access: | https://www.vestnik-donstu.ru/jour/article/view/887 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Using TLA+/TLC for modeling and verification of cryptographic protocols
by: Maxim V. Neyzov, et al.
Published: (2024-12-01) -
CPN Tools-Assisted Simulation and Verification of Nested Petri Nets
by: L. W. Dworza´nski, et al.
Published: (2015-03-01) -
Analysis and Verification of Message Sequence Charts of Distributed Systems with the Help of Coloured Petri Nets
by: S. A. Chernenok, et al.
Published: (2014-12-01) -
Formal modeling of a causal consistent distributed system and verification of its history via model checking using colored Petri net
by: Khalid Amjed Mohammed Alsaegg, et al.
Published: (2025-07-01) -
Review of hierarchy in Petri Nets
by: Michał Markiewicz, et al.
Published: (2025-07-01)