By Topic

On the logical verification of a group key agreement protocol for resource constrained mobile devices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yue Li ; Dept. of Electron. & Comput. Eng., Univ. of Limerick, Limerick ; Newe, T.

Due to the rapid growth of mobile networks, many advanced applications have been deployed. However, security of data will be an important factor for their full adoption. Most of these applications will be utilized on resource constrained devices, which makes security protocols currently used in wired networks not fully applicable to mobile networks. Recently, a number of key agreement protocols have been proposed for use with wireless networks involving resource-limited devices. These include the DDH-based group key agreement protocol [1], the protocol proposed by Bresson et al. [2] and Tsengpsilas protocol [3]. In order to provide assurance that these protocols are verifiably secure and trustworthy it is necessary to perform a formal verification on their design specifications. In this paper Tsengpsilas protocol is discussed and a formal verification is performed using the Coffey-Saidha-Newe (CSN) modal logic[4]. As a result of this verification some potential problems with the protocol are presented.

Published in:

Telecommunication Networks and Applications Conference, 2007. ATNAC 2007. Australasian

Date of Conference:

2-5 Dec. 2007