Formal modeling and verification of sensor network encryption protocol in the OTS/CafeOBJ method

Authors:
Iakovos Ouranos;Petros Stefaneas;Kazuhiro Ogata
Affiliations:
School of Elec. and Comp. Eng., National Tech. Univ. of Athens and Hellenic Civil Aviation Authority, Heraklion Airport;School of Appl. Math. and Phys. Sci., National Tech. Univ. of Athens,;School of Info. Sci., Japan Adv. Inst. of Sci. and Tech.
Venue:
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Year:
2010

Citing 15
Cited 0

Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
A hidden agenda

Theoretical Computer Science
SPINS: security protocols for sensor networks

Wireless Networks
Rewriting logic: roadmap and bibliography

Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Flaw and modification of the iKP electronic payment protocols

Information Processing Letters
Efficient Authentication and Signing of Multicast Streams over Lossy Channels

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Equational Approach to Formal Analysis of TLS

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
On the Formal Verification of the SNEP Key Agreement Protocol for Wireless Sensor Networks

SENSORCOMM '07 Proceedings of the 2007 International Conference on Sensor Technologies and Applications
Simulation-based Verification for Invariant Properties in the OTS/CafeOBJ Method

Electronic Notes in Theoretical Computer Science (ENTCS)
Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude

Theoretical Computer Science
An Algebraic Framework for Modeling of Mobile Systems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Automated Security Protocol Analysis With the AVISPA Tool

Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying security protocols for sensor networks using algebraic specification techniques

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Induction-guided falsification

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.