dc.contributor.author |
Ouranos, I |
en |
dc.contributor.author |
Stefaneas, P |
en |
dc.contributor.author |
Ogata, K |
en |
dc.date.accessioned |
2014-03-01T02:46:48Z |
|
dc.date.available |
2014-03-01T02:46:48Z |
|
dc.date.issued |
2010 |
en |
dc.identifier.issn |
03029743 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/32859 |
|
dc.subject |
Algebraic Specification |
en |
dc.subject |
CafeOBJ |
en |
dc.subject |
Formal Verification |
en |
dc.subject |
Observational Transition Systems |
en |
dc.subject |
Security |
en |
dc.subject |
Wireless Sensor Networks |
en |
dc.subject.other |
Algebraic specifications |
en |
dc.subject.other |
CafeOBJ |
en |
dc.subject.other |
Formal Verification |
en |
dc.subject.other |
Observational transition systems |
en |
dc.subject.other |
Security |
en |
dc.subject.other |
Wireless sensor |
en |
dc.subject.other |
Algebra |
en |
dc.subject.other |
Cryptography |
en |
dc.subject.other |
Formal methods |
en |
dc.subject.other |
Network protocols |
en |
dc.subject.other |
Network security |
en |
dc.subject.other |
Sensor networks |
en |
dc.subject.other |
Specifications |
en |
dc.subject.other |
Wireless sensor networks |
en |
dc.title |
Formal modeling and verification of sensor network encryption protocol in the OTS/CafeOBJ method |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1007/978-3-642-16558-0_9 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1007/978-3-642-16558-0_9 |
en |
heal.publicationDate |
2010 |
en |
heal.abstract |
Sensor Network Encryption Protocol (SNEP) is one of the secure building blocks of the SPINS Protocol Suite and provides data confidentiality, two-party data authentication and evidence of data freshness in a wireless sensor network. We have formally analyzed SNEP and a node-to-node key agreement protocol based on it, using the OTS/CafeOBJ method. Among other invariants, we have verified that the protocols possess the important security properties of authenticity and confidentiality of relevant message components. To our knowledge, we are the first to formally analyze SNEP using algebraic specification techniques. © 2010 Springer-Verlag. |
en |
heal.journalName |
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
en |
dc.identifier.doi |
10.1007/978-3-642-16558-0_9 |
en |
dc.identifier.volume |
6415 LNCS |
en |
dc.identifier.issue |
PART 1 |
en |
dc.identifier.spage |
75 |
en |
dc.identifier.epage |
89 |
en |