A Probabilistic Attacker Model for Quantitative Verification of DoS Security Threats

Basagiannis, Stylianos; Katsaros, Panagiotis; Pombortsis, Andreas; Αλεξίου, Νικόλαος

doi:10.1109/compsac.2008.48

Cited by 7 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have composed a successful target‐oriented intruder model, as a formal guidance manuscript giving the opportunity to correct model a protocol system while enforcing an intruder with specific attack tactics, aiming in this way, the model checker to validate the protocol against known attack actions. Although the difference of the used formal analysis in 2 and 13, we denote in this paper the scalability and the effectiveness of adopting such an intruder development approach for the verification of security protocols.…”

Section: Discussionmentioning

confidence: 99%

“…This allows the application of the proposed intruder model to larger and more complex systems and, thus, opening new potentialities in revealing for example multi‐protocol attacks 12 on cryptographic protocols that are executed in the same environment. Using the same intruder's formal description we have successfully described and implemented in 13 an intruder model for performing a Denial of Service attack to the Host Identity Protocol (HIP) 14. While in 2 we have also used the SPIN model checker, in 13 we modeled the specified intruder (and its actions) with PRISM, using probabilistic model checking primitives.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Synthesis of attack actions using model checking for the verification of security protocols

Basagiannis

Katsaros

Pombortsis

2011

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

Model checking cryptographic protocols have evolved to a valuable method for discovering counterintuitive security flaws, which makes it possible for a hostile agent to subvert the goals of the protocol. Published works and existing security analysis tools are usually based on general intruder models that embody at least some aspects of the seminal work of Dolev--Yao, in an attempt to detect failures of secrecy. In this work, we propose an alternative intruder model, which is based on a thorough analysis of how potential attacks might proceed. We introduce an intruder model that provides an open-ended base for the integration of multiple basic attack tactics. Those attack tactics have the possibility to be combined, in a way to compose complex attack actions that require a number of procedural steps from the intruder's side, such as a Denial of Service attack. In our model checking approach, protocol correctness is checked by appropriate user-supplied assertions or reachability of invalid end states. The analyst can express security properties of specific attack actions that are not restricted to safety violations captured by a generic model checker. The described intruder model methodology was implemented within the SPIN model checker for verifying two security protocols, Micromint and PayWord.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Synthesis of attack actions using model checking for the verification of security protocols

Basagiannis

Katsaros

Pombortsis

2011

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…We use PRISM [21] which is a probabilistic model checking tool to evaluate the performance of the priority message example because that tool has already been apply in randomized distributed algorithms [22], communication protocols [23] and security [24]. The tool of PRISM is a probabilistic model checker using an automatic formal verification technique for the analysis of systems which exhibit stochastic behavior.…”

Section: Numerical Resultsmentioning

confidence: 99%

Analysis and Modeling of a Priority Inversion Scheme for Starvation Free Controller Area Networks

Lin

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYControl Area Network (CAN) development began in 1983 and continues today. The forecast for annual world production in 2008 is approximately 65-67 million vehicles with 10-15 CAN nodes per vehicle on average [1]. Although the CAN network is successful in automobile and industry control because the network provides low cost, high reliability, and priority messages, a starvation problem exists in the network because the network is designed to use a fixed priority mechanism. This paper presents a priority inversion scheme, belonging to a dynamic priority mechanism to prevent the starvation problem. The proposed scheme uses one bit to separate all messages into two categories with/without inverted priority. An analysis model is also constructed in this paper. From the model, a message with inverted priority has a higher priority to be processed than messages without inverted priority so its mean waiting time is shorter than the others. Two cases with and without inversion are implemented in our experiments using a probabilistic model checking tool based on an automatic formal verification technique. Numerical results demonstrate that low-priority messages with priority inversion have better expression in the probability in a full queue state than others without inversion. However, our scheme is very simple and efficient and can be easily implemented at the chip level.

show abstract

“…In Listing 2, it is assumed that the verification rate remains the same for verifications performed by the same entity. Thus, ver E 1 = ver E 3 …”

Section: Develop the Cemd-ctmc Modelmentioning

confidence: 99%

“…During the last decades, the fact that a number of communication protocols have been published with security flaws [1,2,3] urges the protocol designers the CEMD protocol can assure security guaranties for low-cost participants involved in multiple protocol sessions and operating in error-prone environments, and if so, at what cost. Thus, the next two circles of Fig.…”

Section: Introductionmentioning

confidence: 99%

Quantitative analysis of a certified e-mail protocol in mobile environments: A probabilistic model checking approach

Basagiannis

Petridou

Αλεξίου

et al. 2011

Computers & Security

View full text Add to dashboard Cite

Formal analysis techniques, such as probabilistic model checking, offer an effective mechanism for model-based performance and verification studies of communication systems' behavior that can be abstractly described by a set of rules i.e., a protocol. This article presents an integrated approach for the quantitative analysis of the Certified E-mail Message Delivery (CEMD) protocol that provides security properties to electronic mail services. The proposed scheme employs a probabilistic model checking analysis and provides for the first time insights on the impact of CEMD's error tolerance on computational and transmission cost. It exploits an efficient combination of quantitative analysis and specific computational and communication parameters, i.e., the widely used Texas Instruments TMS320C55x Family operating in an High Speed Downlink Packet Access (HSDPA) mobile environment, where multiple CEMD participants execute parallel sessions with high bit error rates (BERs). Furthermore, it offers a tool-assistant approach for the protocol designers and analysts towards the verification of their products under varying parameters. Finally, this analysis can be also utilized towards reliably addressing cost-related issues of certain communication protocols and deciding on their cost-dependent viability, taking into account limitations that are introduced by hardware specifications of mobile devices and noisy mobile environments.

show abstract

A Probabilistic Attacker Model for Quantitative Verification of DoS Security Threats

Cited by 7 publications

References 5 publications

Synthesis of attack actions using model checking for the verification of security protocols

Synthesis of attack actions using model checking for the verification of security protocols

Analysis and Modeling of a Priority Inversion Scheme for Starvation Free Controller Area Networks

Quantitative analysis of a certified e-mail protocol in mobile environments: A probabilistic model checking approach

Contact Info

Product

Resources

About