Olga Siedlecka-Lamch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Olga Siedlecka-Lamch has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Mirosław Kurkowski
Institute of Computer Science, Cardinal St. Wyszynski University, Woycickiego 1/3, 01-938 Warsaw, Poland
13 shared publications - Sabina Szymoniak
Department of Computer Science, Czestochowa University of Technology, 42-201 Czestochowa, Poland
11 shared publications - Agnieszka M. Zbrzezny
Department of Computer Science Faculty of Design SWPS University Warsaw Poland
3 shared publications - Andrzej Zbrzezny
Department of Mathematics and Computer Science, Jan Dlugosz University in Czestochowa, Armii Krajowej 13/15, 42-200 Czestochowa, Poland
3 shared publications - Henryk Piech
Częstochowa University of Technology
3 shared publications - Imed El Fray
West Pomeranian University of Technology, Szczecin, Poland
2 shared publications
Latest Publications
- 6 September 2025
- Published by Springer Nature
- p. 554-565
Digital Agriculture Under Threat: Cybersecurity Challenges and Policy Gaps
- 6 September 2025
- Published by Springer Nature
- p. 554-565
Digital Agriculture Under Threat: Cybersecurity Challenges and Policy Gaps
- Open Access
- 10 November 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (22) , 10333
Timed Interpreted Systems as a New Agent-Based Formalism for Verification of Timed Security Protocols
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.
- 10 November 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (22) , 10333
Open AccessTimed Interpreted Systems as a New Agent-Based Formalism for Verification of Timed Security Protocols
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
- 3 September 2024
- Published by MDPI AG in Preprints.org
Timed Interpreted Systems as a New Agent-Based Formalism for Verification of Timed Security Protocols
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.
- 3 September 2024
- Published by MDPI AG in Preprints.org
Open AccessTimed Interpreted Systems as a New Agent-Based Formalism for Verification of Timed Security Protocols
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.
- 23 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 273-279
How to improve blockchain for blogosphere?
The article presents the impact of the problem of Byzantine generals on the blockchain-based network on the example of the decentralised blogosphere. The oral message algorithm's implementation was tested and compared to the signed message algorithm adapted to the blogosphere example. The work showed that the problem of the Byzantine generals poses a significant threat to the correct operation of the network. However, it has also been proven that, based on authentication methods, it is possible to implement an algorithm that allows for the detection of fraud attempts and an appropriate reaction without the need for many recursive calls. A further research direction was also proposed - adapting the above algorithm to situations where not all servers will receive complete information from other nodes.
- 23 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 273-279
How to improve blockchain for blogosphere?
The article presents the impact of the problem of Byzantine generals on the blockchain-based network on the example of the decentralised blogosphere. The oral message algorithm's implementation was tested and compared to the signed message algorithm adapted to the blogosphere example. The work showed that the problem of the Byzantine generals poses a significant threat to the correct operation of the network. However, it has also been proven that, based on authentication methods, it is possible to implement an algorithm that allows for the detection of fraud attempts and an appropriate reaction without the need for many recursive calls. A further research direction was also proposed - adapting the above algorithm to situations where not all servers will receive complete information from other nodes.
- Open Access
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 16439-16455
User Authentication Protocol Based on the Location Factor for a Mobile Environment
The way the internet is used by billions of users around the world has been revolutionized by mobile devices. The capabilities of smartphones are constantly growing, and the number of services available for mobile devices is also increasing. This undeniable trend makes smartphones terminals for accessing services that process confidential data, which make smartphones priceless targets of cyberattacks. Along with an increasing number of mobile services, the methods of securing the confidentiality, integrity and availability of systems used have also evolved and adapted to the capabilities of a mobile environment. One of the important security services is the user authentication process. This process often implements the postulates of strong authentication, multistage authentication based on factors from the knowledge, position and inherence categories. Unfortunately, the implementation of the factors belonging to these categories is not always possible due to the limitations of smartphones, such as the lack of interfaces for the implementation of biometrics or environmental factors -problems with network or internet access in various countries and regions. Therefore, there is a need to analyse the possibility of implementing a strong authentication process based on additional information about users, e.g., based on location data. The article analyses the requirements for the authentication process and authentication factors. Based on the performed analysis, the criteria that each authentication factor must meet were defined. This article presents a proposal for a user authentication protocol based on the location factor for a mobile environment. The method can be used in the case of problems with the implementation of strong authentication or as an additional authentication factor that increases the security of the user identity confirmation process. The presented protocol has been analysed in terms of performance, security and compliance with the requirements related to the authentication factors.
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 16439-16455
Open AccessUser Authentication Protocol Based on the Location Factor for a Mobile Environment
The way the internet is used by billions of users around the world has been revolutionized by mobile devices. The capabilities of smartphones are constantly growing, and the number of services available for mobile devices is also increasing. This undeniable trend makes smartphones terminals for accessing services that process confidential data, which make smartphones priceless targets of cyberattacks. Along with an increasing number of mobile services, the methods of securing the confidentiality, integrity and availability of systems used have also evolved and adapted to the capabilities of a mobile environment. One of the important security services is the user authentication process. This process often implements the postulates of strong authentication, multistage authentication based on factors from the knowledge, position and inherence categories. Unfortunately, the implementation of the factors belonging to these categories is not always possible due to the limitations of smartphones, such as the lack of interfaces for the implementation of biometrics or environmental factors -problems with network or internet access in various countries and regions. Therefore, there is a need to analyse the possibility of implementing a strong authentication process based on additional information about users, e.g., based on location data. The article analyses the requirements for the authentication process and authentication factors. Based on the performed analysis, the criteria that each authentication factor must meet were defined. This article presents a proposal for a user authentication protocol based on the location factor for a mobile environment. The method can be used in the case of problems with the implementation of strong authentication or as an additional authentication factor that increases the security of the user identity confirmation process. The presented protocol has been analysed in terms of performance, security and compliance with the requirements related to the authentication factors.
- Open Access
SAT and SMT-Based Verification of Security Protocols Including Time Aspects
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.
Open AccessSAT and SMT-Based Verification of Security Protocols Including Time Aspects
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.
- 28 August 2020
- Published by Springer Nature
- p. 142-151
Probabilistic and Timed Analysis of Security Protocols
- 28 August 2020
- Published by Springer Nature
- p. 142-151
Probabilistic and Timed Analysis of Security Protocols
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 320-327
SMT Solvers as Efficient Tools for Automatic Time Properties Verification of Security Protocols
This paper presents our next research related to the use of SMT techniques for the analysis of security protocols. The behaviours of users and their changing knowledge during an investigated protocol executions are modelled as networks of communicating timed automata. The time properties are defined as the reachability properties of some, properly indicated states in the product automaton. We can do it using specially described time conditions, that can express dependencies between defined as a reachability property of some, chosen states in automata network, the possibility of performing some desired protocol steps and filling time constraints that use generation time of timestamps and lifetimes or/and networks delays. For our experiments we use boolean and SMT encodings that are the basis for respectively, SAT-and SMT-based bounded model checking. For SMT, the runs in product automaton are translated into the quantifier-free first-order formula. So far, we have implemented a well known bounded model checking algorithm and evaluated it for Needham-Schroeder Public Key, Needham Schroeder Symmetric Key, Woo Lam Pi and Wide Mouth Frog protocols. Now we show the tests carried out for the group of four known from the literature security protocols. We also compared our new SMT-based approach with a previous, only SAT-based, technique. For experiments, we used Minisat SAT solver, Z3, Yices2, CVC4 and MathSAT SMT solvers.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 320-327
SMT Solvers as Efficient Tools for Automatic Time Properties Verification of Security Protocols
This paper presents our next research related to the use of SMT techniques for the analysis of security protocols. The behaviours of users and their changing knowledge during an investigated protocol executions are modelled as networks of communicating timed automata. The time properties are defined as the reachability properties of some, properly indicated states in the product automaton. We can do it using specially described time conditions, that can express dependencies between defined as a reachability property of some, chosen states in automata network, the possibility of performing some desired protocol steps and filling time constraints that use generation time of timestamps and lifetimes or/and networks delays. For our experiments we use boolean and SMT encodings that are the basis for respectively, SAT-and SMT-based bounded model checking. For SMT, the runs in product automaton are translated into the quantifier-free first-order formula. So far, we have implemented a well known bounded model checking algorithm and evaluated it for Needham-Schroeder Public Key, Needham Schroeder Symmetric Key, Woo Lam Pi and Wide Mouth Frog protocols. Now we show the tests carried out for the group of four known from the literature security protocols. We also compared our new SMT-based approach with a previous, only SAT-based, technique. For experiments, we used Minisat SAT solver, Z3, Yices2, CVC4 and MathSAT SMT solvers.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 000363-000370
Comparative study of relational and graph databases
We live in a time of incredible technological development. In a fraction of a second, millions of information are generated and processed all over the world. The need to develop new models of databases is related to the dynamic and the amount of data stored. Using database schemes which are rigid and do not quickly adapt to changes occurring in the real world is ineffective and sometimes simply impossible. The solution of all these problems could be, among others, graph databases.In this talk, we present a detailed comparison of relational and graph databases, compiling the stages of design, implementation and testing. At each stage, we keep the same data in both databases, checking how easily they can be modelled in each logical model, then imported, and finally made queries and modifications on them.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 000363-000370
Comparative study of relational and graph databases
We live in a time of incredible technological development. In a fraction of a second, millions of information are generated and processed all over the world. The need to develop new models of databases is related to the dynamic and the amount of data stored. Using database schemes which are rigid and do not quickly adapt to changes occurring in the real world is ineffective and sometimes simply impossible. The solution of all these problems could be, among others, graph databases.In this talk, we present a detailed comparison of relational and graph databases, compiling the stages of design, implementation and testing. At each stage, we keep the same data in both databases, checking how easily they can be modelled in each logical model, then imported, and finally made queries and modifications on them.
- 11 August 2019
- Published by Springer Nature
- p. 523-534
A Fast Method for Security Protocols Verification
- 11 August 2019
- Published by Springer Nature
- p. 523-534
A Fast Method for Security Protocols Verification