An efficient constant round ID-based group key agreement protocol for ad hoc networks

15Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an authenticated ID-based Group Key Agreement (GKA) protocol which requires only one round for its execution. The protocol is contributory, energy-balanced and does not require an online TTP. All these properties and in particular the minimum round requirement, makes the protocol especially suited for ad hoc networks. In the paper, we will demonstrate the security properties of the new GKA protocol and present its communication/computation efficiency. Finally, we will compare the new protocol with all the one-round GKA protocols proposed so far in the literature and show that it outperforms all the ID-based protocols of this category. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Konstantinou, E. (2013). An efficient constant round ID-based group key agreement protocol for ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7873 LNCS, pp. 563–574). https://doi.org/10.1007/978-3-642-38631-2_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free