The full text of this article


A non-interactive certificateless two-party authenticated key agreement protocol for wireless sensor networks
by Suman Bala; Anil K. Verma
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 21, No. 2, 2016


Abstract: Key agreement protocol(s) is one of the important factors for establishing communication between two parties. Recent works support the use of pairing free certificateless authenticated key agreement protocol(s) and becomes a promising base in a energy-famished WSN. Certificateless concept provides an authentication by eliminating the need of certificates of traditional public key cryptography and key escrow problem of identity based cryptography (IBC). This paper presents a non-interactive Certificateless two-party authenticated key agreement (NI-CTAKA) protocol for WSN. NI-CTAKA is pairing-free as well as reduces number of scalar point multiplications. NI-CTAKA has been implemented on MICAz platform using TinyOS-2.1.2 and RELIC-0.3.3 cryptographic library and the results has been analysed for storage-cost, running time and energy consumption. Further, NI-CTAKA is proven to be secure in the security model presented by Lipold et al. extended Canetti-Krawczyk (eCK) model. The comparative analysis proves that the proposed protocol is more efficient than the existing protocols.

Online publication date: Mon, 07-Mar-2016


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:


    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email