Timed Interpreted Systems as a New Agent-Based Formalism for Verification of Timed Security Protocols
Preprint
- 3 September 2024
- preprint
- Published by MDPI AG in Preprints.org
Abstract
This article introduces a new method for modelling and verifying the execution of timed security protocols (TSP) and their time-dependent security properties. The method, which is both novel and reliable, uses an extension of interpreted systems, accessible semantics in multi-agent systems, and timed interpreted systems (TIS) with dense time semantics to model TSP executions. We enhance the models of TSPs by incorporating delays and varying lifetimes to capture real-life aspects of protocol executions. To illustrate the method, we model a timed version of the Needham-Schroeder Public Key Authentication Protocol. We have also developed a new SMT-based bounded model checking reachability algorithm for the proposed structures and implemented it with the tool. The method comprises a new procedure for modelling TSP executions, a translation of TSP into TIS, and a translation of TIS's reachability problem into the SMT problem. The paper also includes thorough experimental results for nine protocols modelled by TIS and discusses the findings in detail.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Automated Verification for Real-Time Systems2023
- Timed Automata Verification and Synthesis via Finite Automata Learning2023
- Efficient Verification of Security Protocols Time Properties Using SMT Solvers2019
- Immunology of Infectious Processes2019
- Toward live domain-specific languagesSoftware and Systems Modeling, 2017
- Automated Verification of Timed Security Protocols with Clock Drift2016
- Verification of Mutual Authentication Protocol for MobInfoSec System2015
- Checking EMTLK Properties of Timed Interpreted Systems Via Bounded Model CheckingStudia Logica, 2015
- SATMC: a SAT-based model checker for security protocols, business processes, and security APIsInternational Journal on Software Tools for Technology Transfer, 2015
- Node-Weighted Network Design in Planar and Minor-Closed Families of GraphsLecture Notes in Computer Science, 2012