Specific applications like military or public emergency ones require secure group communication in ad hoc environments. The most suitable solution to provide the expected level of security to these services is the provision of a key management protocol. This paper shows the specific challenges towards key management protocols for securing multicast communications in ad hoc networks, and provide...

We describe CORAL, a counterexample finder for incorrect inductive conjectures. By devising a first-order version of Paulson’s formalism for cryptographic protocol analysis, [10], we are able to use CORAL to attack protocols which may have an unbounded number of principals involved in a single run. We show two new attacks CORAL has found on the Asokan–Ginzboorg protocol for establishing a group...

In this research paper, a scalable and efficient multicast secure protocol for large and dynamic systems that relies on trusted Key Generation Center (KGC) is proposed. In this protocol, we partition the entire group into several subgroups which is controlled by Intermediate Controller (IC). Our protocol is based on Iolus protocol and the hierarchical structure of LKH protocol. The decompositio...

Group key establishment is one of the basic building blocks in securing group communication. In this paper, motivated by Desmedt's BD-II protocol, we propose a secure ID-Based group key establishment protocol which has a constant number of rounds and requires only (log ) O n computation and communication. Our scheme achieves key negotiate by scalar multiplication other than using pairing comput...

This paper describes the modelling of a two multicast group key management protocols in a first-order inductive model, and the discovery of previously unknown attacks on them by the automated inductive counterexample finder CORAL. These kinds of protocols had not been analysed in a scenario with an active intruder before. CORAL proved to be a suitable tool for a job because, unlike most automat...

A sensor network operating in open environments requires a network-wide group key for confidentiality of exchanged messages between sensor nodes. When a node behaves abnormally due to its malfunction or a compromise attack by adversaries, the central sink node should update the group key of other nodes. The major concern of this group key update procedure will be the multi-hop communication ove...

Secure and efficient communication among a set of mobile nodes is one of the most important aspect in P2P wireless networks. Security of various group-oriented applications requires a group secret shared between all participants. Several group key protocols have been presented in the literature to enable secrecy of communication among dynamic group of participants. However, most of them suffer ...

Our project will focus on real time system with constraints on security, real-time performance and limited resource. It is the seeking for performance optimization after a trade of all the constraints considered. Namely, we will cover the following areas: (a) Secure wireless communication in MANETs (b) Scalable and lightweight secure group communication, including authentication of group member...

This paper presents an efficient solution to key exchange problem for large groups in the password-based scenario. Our scheme can combine existing group protocols to get a hybrid group key exchange protocol which is efficient in terms of both computation and communication. And the resulting protocol allows users to securely join and leave the group at any time—the so-called dynamic case. For dy...

I f multicast communication appears as the most eficient way to send data to a group of participants, it presents also more vulnerabilities to attacks and requires services such as authentication, integrity and confidentiality to transport data securely. In this papel; we present the protocol Baal’ as a scalable solution to group key inanagement problems and show how Baal resolves the user’s re...