Slede: Framework for automatic verification of sensor network security protocol implementations

Hanna, Youssef; Rajan, Hridesh

doi:10.1109/icse-companion.2009.5071045

Cited by 16 publications

(19 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We mention works focusing on the security of routing [19,2,20,32], local area networking [13], or broadcast authentication [12]. Closer to our work, the problem of DB has been treated formally in [17] by Meadows et al Their paper is concerned with distance estimation rather than ND, but more importantly, the approach is different.…”

Section: Related Workmentioning

confidence: 99%

Towards provable secure neighbor discovery in wireless networks

Poturalski

Papadimitratos

Hubaux

2008

Proceedings of the 6th ACM Workshop on Formal Methods in Security Engineering

View full text Add to dashboard Cite

In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and the resultant compromise of the dependent functionality of wireless systems, numerous works proposed solutions to secure ND. Nonetheless, until very recently, there has been no formal analysis of secure ND protocols. We close this gap in [24], but we concentrate primarily on the derivation of an impossibility result for a class of protocols. In this paper, we focus on reasoning about specific protocols. First, we contribute a number of extensions and refinements on the framework of [24]. As we are particularly concerned with the practicality of provably secure ND protocols, we investigate availability and redefine accordingly the ND specification, and also consider composability of ND with other protocols.Then, we propose and analyze two secure ND protocols: We revisit one of the protocols analyzed in [24], and introduce and prove correct a more elaborate challenge-response protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

Towards provable secure neighbor discovery in wireless networks

Poturalski

Papadimitratos

Hubaux

2008

Proceedings of the 6th ACM Workshop on Formal Methods in Security Engineering

View full text Add to dashboard Cite

show abstract

“…Model checking has been used successfully in practice to verify wireless network security protocols (e.g. [35,36]). …”

Section: Formal Analysis Using Avispamentioning

confidence: 99%

Lightweight and provably secure user authentication with anonymity for the global mobility network

Chen

Chan

et al. 2011

Int J Communication

109

View full text Add to dashboard Cite

SUMMARYSeamless roaming in the global mobility network (GLOMONET) is highly desirable for mobile users, although their proper authentication is challenging. This is because not only are wireless networks susceptible to attacks, but also mobile terminals have limited computational power. Recently, some authentication schemes with anonymity for the GLOMONET have been proposed. This paper shows some security weaknesses in those schemes. Furthermore, a lightweight and provably secure user authentication scheme with anonymity for the GLOMONET is proposed. It uses only symmetric cryptographic and hash operation primitives for secure authentication. Besides, it takes only four message exchanges among the user, foreign agent and home agent. We also demonstrate that this protocol enjoys important security attributes including prevention of various attacks, single registration, user anonymity, user friendly, no password/verifier table, and use of one-time session key between mobile user and foreign agent. The security properties of the proposed protocol are formally validated by a model checking tool called AVISPA. Furthermore, as one of the new features in our protocol, it can defend smart card security breaches.

show abstract

“…Most work on analyzing the software for sensornets has been focused on verifying or understanding the network communication (e.g., [2,4]), or analyzing and predicting power consumption and duty cycles (e.g., [12,14]). There is just beginning some work in tools for assertion checking and correctness checking [1,10].…”

Section: Related Workmentioning

confidence: 99%

Lightweight monitoring of sensor software

Hammad

Cook

2009

Proceedings of the 2009 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Wireless sensors are very small computers, and understanding the timing and behavior of software written for them is crucial to ensuring that they perform correctly. This paper outlines a lightweight method for gathering behavioral and timing information from simulated executions of software written in the nesC/TinyOS environment. The resulting data is used to generate both behavioral and timing profiles of the software, using UML sequence diagrams to visualize the behavior and to present the timing information.

show abstract

Slede: Framework for automatic verification of sensor network security protocol implementations

Cited by 16 publications

References 9 publications

Towards provable secure neighbor discovery in wireless networks

Towards provable secure neighbor discovery in wireless networks

Lightweight and provably secure user authentication with anonymity for the global mobility network

Lightweight monitoring of sensor software

Contact Info

Product

Resources

About