Group key exchange protocols allow their participants to compute a secret key which can be used to ensure security and privacy for various multi-party applications. The resulting group key should be computed through cooperation of all protocol participants such that none of them is trusted to have any advantage concerning the protocol’s output. This trust relationship states the main difference...

1570-8705/$ see front matter 2013 Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.adhoc.2013.05.009 ⇑ Corresponding author. E-mail addresses: [email protected] (L. Veltri), simone.cirani@unipr. it (S. Cirani), [email protected] (S. Busanelli), gianluigi. [email protected] (G. Ferrari). 1 Iolus [6] for example, is a scheme that interferes with the packet stream, si...

This book gives an introduction to group key management protocols in different network settings. It can be recommended to early researchers in the areas of group key management, secure multicast and secure communication in sensor networks. The book discusses various security issues in group communications in a network-aware approach. However, it fails to show how to rigorously analyze group key...

Usually in a password-authenticated group key exchange protocols, all group members have the same password. However, the setting where all clients share the same password is not always practical. In this paper, we will introduce a new group key exchange protocol with different member having different password. Meanwhile we will prove its security in the standard model.

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...