MKMirosław Kurkowski

Mirosław Kurkowski

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Mirosław Kurkowski has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Defense and Security Mechanisms in the Internet of Things: A Review

    by Sabina Szymoniak, Jacek Piątkowski, Mirosław Kurkowski

    The Internet of Things (IoT) transforms traditional technology by introducing smart devices into almost every field, enabling real-time monitoring and automation. Despite the obvious benefits, the rapid deployment of IoT presents numerous security challenges, including vulnerabilities in network attacks and communication protocol weaknesses. While several surveys have addressed these aspects, there remains a lack of understanding of integrating all potential defense mechanisms, such as intrusion detection systems (IDSs), anomaly detection frameworks, and authentication protocols, into a comprehensive security framework. To overcome this, the following survey aims to critically review existing security mechanisms in IoT environments and significantly fill these gaps. In particular, this paper reviews state-of-the-art approaches for intrusion detection, key agreement protocols, and anomaly detection systems, pointing out their advantages and disadvantages and identifying the gaps in each field requiring more research. We identify innovative strategies by systematically analysing existing approaches and propose a roadmap for enhancing IoT security. This work contributes to the field by offering a fresh perspective on defense mechanisms and delivering actionable insights for researchers and practitioners securing IoT ecosystems.


  • Open Access

    Timed Interpreted Systems as a New Agent-Based Formalism for Verification of Timed Security Protocols

    by Agnieszka M. Zbrzezny, Olga Siedlecka-Lamch, Sabina Szymoniak, Andrzej Zbrzezny, Mirosław Kurkowski

    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.


  • Open Access

    Timed Interpreted Systems as a New Agent-Based Formalism for Verification of Timed Security Protocols

    by Agnieszka M. Zbrzezny, Olga Siedlecka-Lamch, Sabina Szymoniak, Andrzej Zbrzezny, Mirosław Kurkowski

    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.

  • Czy można zakochać się w Jessice? — czyli o Nigeryjskim Przekręcie z perspektywy Analizy Transakcyjnej

    by Zbigniew Łęski, Mirosław Kurkowski, Bogusław Gozdecki, William Steingartner

    Artykuł przedstawia analizę prowokacyjnie przeprowadzonych korespondencji z cyberprzestępcami stosującymi tzw. nigeryjski przekręt. W ciągu dwóch lat akademickich we współpracy ze studentami Uniwersytetu Kardynała Stefana Wyszyńskiego w Warszawie przeprowadzono kilkanaście takich prowokacji. Najdłuższa z korespondencji trwała osiem tygodni. Zgromadzony materiał, liczący kilkadziesiąt stron maszynopisu, został przeanalizowany w świetle analizy transakcyjnej — jednej z technik stosowanych do analizy zachowań w komunikacji międzyludzkiej. Proces prowokacji oraz wyniki analizy przedstawiamy poniżej


  • Open Access

    Partial mathematical modeling and analysis of the AES system

    by Sylwia Stachowiak, Mirosław Kurkowski

    Journal of Applied Mathematics and Computational Mechanics, Prace Naukowe Instytutu Matematyki i Informatyki, Politechnika Częstochowska, Scientific Research of the Institute of Mathematics and Computer Science, Czestochowa University of Technology


  • Open Access

    SAT and SMT-Based Verification of Security Protocols Including Time Aspects

    by Sabina Szymoniak, Olga Siedlecka-Lamch, Agnieszka M. Zbrzezny, Andrzej Zbrzezny, Miroslaw Kurkowski

    For many years various types of devices equipped with sensors have guaranteed proper work in a huge amount of machines and systems. For the proper operation of sensors, devices, and complex systems, we need secure communication. Security protocols (SP) in this case, guarantee the achievement of security goals. However, the design of SP is not an easy process. Sometimes SP cannot realise their security goals because of errors in their constructions and need to be investigated and verified in the case of their correctness. Now SP uses often time primitives due to the necessity of security dependence on the passing of time. In this work, we propose and investigate the SAT-and SMT-based formal verification methods of SP used in communication between devices equipped with sensors. For this, we use a formal model based on networks of communicating timed automata. Using this, we show how the security property of SP dedicated to the sensors world can be verified. In our work, we investigate such timed properties as delays in the network and lifetimes. The delay in the network is the lower time constraint related to sending the message. Lifetime is an upper constraint related to the validity of the timestamps generated for the transmitted messages.


  • Complexity of Security Protocols Verification Tools

    by Michal Mazur, Miroslaw Kurkowski

    Since the eighties of the XX century, many methods and several automatic tools for security protocols verification have been introduced and successfully used. These tools allowed protocols designers to discover many types of attacks upon security solutions in open computer networks. In this paper, we deal with the formal analysis of the complexity of structures used in such tools. In that sense, we are trying to compare two tools developed and successfully used over many years. Firstly, we examine the complexity of the structures used in the SATMC tool, one of the modules of the well-known AVISPA tool, probably the most famous and the most effective in this area. The second analyzed formalism is the cryptographic module of the VerICS tool, constructed for verification of various kinds of concurrent systems. In both cases, we show basic concepts of verification way, present structures used and discuss based on them the protocol verification process. Finally, we try to estimate and compare the complexity of the structures constructed by these tools during the security protocols’ automatic verification process.

  • A Fast Method for Security Protocols Verification

    by Olga Siedlecka-Lamch, Sabina Szymoniak, Miroslaw Kurkowski