We encounter new types of security problems in ad hoc networks because such networks have little or no support infrastructure. In this paper we consider one such problem: a group of people in a meeting room do not have access to public key infrastructure or third party key management service, and th
Dynamic asymmetric group key agreement for ad hoc networks
โ Scribed by Xingwen Zhao; Fangguo Zhang; Haibo Tian
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 291 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1570-8705
No coin nor oath required. For personal study only.
โฆ Synopsis
A group key agreement protocol allows a set of users to establish a common symmetric key via open networks. Dynamic asymmetric group key agreement means that a dynamic set of users form a temporary group and negotiate to share a public encryption key, so that anyone can send message securely and efficiently to the temporary group. Users can join or leave the group efficiently without triggering a completely new key agreement protocol, which will greatly benefit the users in ad hoc networks. We describe a generic construction of dynamic asymmetric group key agreement by combining a conventional authenticated group key agreement, a public key encryption and a multi-signature. Then we give out an instance with constant rounds of interactions and constant transmission cost for each participant.
๐ SIMILAR VOLUMES
## Abstract A mobile ad hoc network does not require fixed infrastructure to construct connections among nodes. Due to the particular characteristics of mobile ad hoc networks, most existing secure protocols in wired networks do not meet the security requirements for mobile ad hoc networks. Most se
In this paper, Minimum Energy Dynamic Source Routing (MEDSR) and Hierarchical Minimum Energy Dynamic Source Routing (HMEDSR) protocols for Mobile Ad Hoc Networks (MANET) are proposed. The objective of MEDSR protocol is to reduce energy consumption in MANET while maintaining connectivity in the netwo