Abstract
This paper proposes an enhanced translation of Security Protocol Language (SPL) in high-level Petri nets in order to allow to prove automatically, using model-checking techniques, the authentication property of Needham-Schroeder- Lowe (NSL) protocol. The proposed approach generates finite nets and goes this way beyond the limitation which was imposed by the previous semantics due to the treatment of the replication operator. In order to reach this goal, we modify the way attacks are modelled. Due to fact that the presented approach focuses on the treatment of the protocol environment, it may be successfully reused for automated verification of properties of other security protocols.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
