Abstract | ||
---|---|---|
We show how a recent language for the description of cryptographic protocols in a real time setting may be suitable to formally verify security aspects of wireless protocols. We define also a compositional proof rule for establishing security properties;of such protocols. The effectiveness of our approach is shown by defining and studying the timed integrity property for muTESLA, a well-known protocol for wireless sensor networks. We are able to deal with protocol specifications with an arbitrary number of agents (senders as well as receivers) running the protocol. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/978-3-540-39958-2_10 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
security,wireless communication,formal analysis,sensor networks | Wireless,Cryptographic protocol,Computer science,Security properties,Wireless sensor network,Distributed computing | Conference |
Volume | ISSN | Citations |
2884 | 0302-9743 | 4 |
PageRank | References | Authors |
0.42 | 11 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roberto Gorrieri | 1 | 2297 | 184.63 |
Fabio Martinelli | 2 | 212 | 21.91 |
Marinella Petrocchi | 3 | 362 | 44.01 |
Anna Vaccarelli | 4 | 122 | 10.40 |