Spanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore, we present a self-stabilized distributed algo
Computationally secure self-healing key distribution with revocation in wireless ad hoc networks
โ Scribed by Ratna Dutta; Sourav Mukhopadhyay; Martin Collier
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 508 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1570-8705
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper introduces a novel self-healing technique for key distribution with revocation and demonstrates how it improves the efficiency over the previous approaches while using the existing idea of secret sharing or revocation polynomial in designing self-healing key distribution schemes with revocation. Unlike the existing approaches, our self-healing mechanism does not need to send the history of revoked users and consequently enables better performance gain over the previous approaches in terms of storage, communication and computation complexity. We propose and analyze a generalized self-healing key distribution using a vector space access structure in order to reach more flexible performance of the scheme. We describe three efficient constructions for scalable self-healing key distribution with t-revocation capability. We provide a rigorous treatment of the security of our constructions in an appropriate security framework and show that they are computationally secure and achieve both forward and backward secrecy.
๐ SIMILAR VOLUMES