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.

Protocol verification, formal analysis, needham-schroeder protocol, colored petri nets, cpn tools, key management

Короткий адрес: https://sciup.org/14249709

IDR: 14249709

Статья научная