Timed Interpreted Systems as a New Agent-Based Formalism for Verification of Timed Security Protocols
Open Access
- 10 November 2024
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 14 (22) , 10333
Abstract
This article introduces a new method for modelling and verifying the execution of timed security protocols (TSPs) and their time-dependent security properties. The method, which is novel and reliable, uses an extension of interpreted systems, accessible semantics in multi-agent systems, and timed interpreted systems (TISs) 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 bounded model checking reachability algorithm for the proposed structures, based on Satisfiability Modulo Theories (SMTs), and implemented it within the tool. The method comprises a new procedure for modelling TSP executions, translating TSPs into TISs, and translating TISs’ reachability problem into the SMT problem. The paper also includes thorough experimental results for nine protocols modelled by TISs and discusses the findings in detail.Keywords
All Related Versions
This publication has 49 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
- Automated Verification of Timed Security Protocols with Clock Drift2016
- SMT-Based Parameter Synthesis for Parametric Timed Automata2016
- 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
- BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performanceAutonomous Agents and Multi-Agent Systems, 2013
- On Establishing and Fixing a Parallel Session Attack in a Security Protocol2008
- An attack on the Needham-Schroeder public-key authentication protocolInformation Processing Letters, 1995