Formal analysis of security protocols for wireless sensor networks

DOI10.2478/V10127-010-0032-7MaRDI QIDQ3075867zbMATH OpenOpenAlexFDO

Authors Marián Novotný

Publication date 17 February 2011

Published in Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Full work available at URL http://tatra.mat.savba.sk/Full/47/05novot.pdf

zbMATH Keywords

applied pi-calculusdata integrityDolev-Yao model of the attackerformal analysissecurity protocolsWireless Sensor Networks

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Cryptography (94A60)

Recommendations

• Formal analysis of some timed security properties in wireless protocols.
• Analysis of security protocols as open systems
• A framework for security analysis of mobile wireless networks
• Extending security protocol analysis: new challenges
• A state-based model of sensor protocols

Cites work

• Computer Aided Systems Theory – EUROCAST 2005
• Computer Aided Verification
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Mobile values, new names, and secure communication

Cited in

(6)

• Formal models and analysis of secure multicast in wired and wireless networks
• A hierarchical formal method for performance evaluation of WSNs protocol
• A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs
• Minimum \(k\)-path vertex cover
• The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs
• PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs

Describes a project that uses

Uses Software

• AVISPA

This page was built for publication: Formal analysis of security protocols for wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075867)