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

Abstract

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.

Modeling and reliability verification of industrial control network protocol based on time state transition matrix

“…The BMC method restricts the parameters (e.g., number of cycles and number of concurrencies) associated with the state space explosion 31 . It encodes the system behavior and property constraints into a finite set of constraints and then uses the SMT solver 32 to automatically perform an exhaustive search for the existence of a counterexample path in the system state space.…”

Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice

“…In [Szy+21], Szymoniak et al build on previous works [JP07; KP12b], and perform a formal modeling and timed analyses of the WooLamPi protocol and of the Sensor Network Encryption Protocol [Per+02]. Reachability using SMT is used to identify the time frames during which a man-in-the middle behavior (i. e., a passive interception of the data) is possible.…”

İlişkilendirme Kuralı Madenciliği Algoritmasını Kullanarak BGP Anomali Tespiti

“…When a path vector message is received, each router must check the advertised path against its policy. If the message conforms to the routers policy, it is updated in both the routing table and the message itself before being sent to the next neighbor (Szymoniak, Siedlecka-Lamch, Zbrzezny, Zbrzezny, & Kurkowski, 2021). It makes the necessary changes to the routing table in order to maintain a track of the autonomous systems that are required to be traversed on the way to the target system.…”