No abstract

Security protocols are one of the most critical elements in enabling the secure communication and processing of information. The presence of flaws in published protocols highlights the complexity of security protocol design. Only formal verification can provide strong confidence in the correctness of security protocols and is considered an imperative step in their design. This paper presents a new theoretical concept, called Layered Proving Trees, for automatically applying logical postulates in logic-based security protocol verification.An algorithm for the new concept is introduced and the soundness and completeness of the technique is proved. Empirical results on the performance of the algorithm are presented. The presented proofs and empirical results demonstrate the feasibility and effectiveness of the Layered Proving Tree approach.

No abstract

Many of the diverse Wireless Sensor Network (WSN) applications, such as home automation, traffic control and medical patient monitoring, have a strong requirement for the confidentiality of sensing data. At the same time, the restricted resources of WSN nodes demand that applications are implemented as efficiently as possible. Recently, the Advanced Encryption Standard (AES) has been proposed as the preferable symmetric cipher for WSN applications. This paper presents a performance and energy consumption analysis of three AES implementations on a wireless sensor node. For each implementation the memory requirements, the execution time and the energy consumption is monitored. The results of the presented analysis show that while the hardware supported AES is faster than the software implementations it is less energy efficient, due to increased power requirements of the additional hardware.

No abstract