Formal analysis of security protocols for wireless sensor networks

DOI10.2478/v10127-010-0032-7zbMath1287.94092OpenAlexW2062569358MaRDI QIDQ3075867

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

formal analysissecurity protocolsdata integrityapplied pi-calculusDolev-Yao model of the attackerWireless Sensor Networks

Mathematics Subject Classification ID

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

Related Items (4)

PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs ⋮ 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

Uses Software

• AVISPA

Cites Work

• Mobile values, new names, and secure communication
• Computer Aided Systems Theory – EUROCAST 2005
• Computer Aided Verification
• Unnamed Item

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