Group Key Agreement in Ad hoc Networks

As the ubiquitous and pervasive computing paradigms gain popularity, Mobile Ad hoc NETworks (MANET) are receiving the increased attention of the research community. Essentially a MANET is a collection of mobile nodes communicating over wireless channels with little (if any at all) fixed, wired infrastructure. Such networks present a number of new challenges to many cryptographic techniques for collaborative group communication including Group Key Agreement. In this report are presented these challenges, some Group Key Agreement protocols proposed for Collaborative Groups and a discussion on their suitability for the MANET environment

Efficient and Dynamic Group Key Agreement in Ad hoc Networks

Confidentiality, integrity and authentication are more relevant issues in Ad hoc networks than in wired fixed networks. One way to address these issues is the use of symmetric key cryptography, relying on a secret key shared by all members of the network. But establishing and maintaining such a key (also called the session key) is a non-trivial problem. We show that Group Key Agreement (GKA) protocols are suitable for establishing and maintaining such a session key in these dynamic networks. We take an existing GKA protocol, which is robust to connectivity losses and discuss all the issues for good functioning of this protocol in Ad hoc networks. We give implementation details and network parameters, which significantly reduce the computational burden of using public key cryptography in such networks

Anti-thrombotics and their impact on inpatient epistaxis management : a tertiary centre experience

Peer reviewedPublisher PD

An Observation about Variations of the Diffie-Hellman Assumption

We generalize the Strong Boneh-Boyen (SBB) signature scheme to sign vectors; we call this scheme GSBB. We show that if a particular (but most natural) average case reduction from SBB to GSBB exists, then the Strong Diffie-Hellman (SDH) and the Computational Diffie-Hellman (CDH) have the same worst-case complexity

A three round authenticated group key agreement protocol for ad hoc networks

International audienceGroup Key Agreement (GKA) protocols enable the participants to derive a key based on each one's contribution over a public network without any central authority. They also provide efficient ways to change the key when the participants change. While some of the proposed GKA protocols are too resource consuming for the constraint devices often present in ad hoc networks, others lack a formal security analysis. In this paper, we propose a simple, efficient and secure GKA protocol well-suited to ad hoc networks and present results of our implementation of the same in a prototype application