Secure communications in wireless ad hoc networks require setting up end-to-end secret keys for communicating node pairs. It is widely believed that although being more complex, a probabilistic key predistribution scheme is much more resilient against node capture than a deterministic one in lightweight wireless ad hoc networks. Supported by the surprisingly large successful attack probabilitie...

In this paper we i.ntroduce R, a distributed public key management service for open networks. f’l offers interfaces by which clients can register, retrieve, and revoke public keys, and escrow, use (to decrypt messages), and recover private keys, all of which can be subjected to access control policy. R is built using multiple servers in a way that ensures its correct operation despite the malic...

The Extensible Authentication Protocol (EAP), defined in RFC 3748, enables extensible network access authentication. This document specifies the EAP key hierarchy and provides a framework for the transport and usage of keying material and parameters generated by EAP authentication algorithms, known as "methods". It also provides a detailed system-level security analysis, describing the conditio...

In this paper we consider the security issues related to the key management in cloud computing. We focus on the difficulty of managing cryptographic keys necessary to maintain for example the confidentiality of information stored in the clouds. In this framework, we present a threshold cryptosystem as well as three protocols, based on cooperation between cloud providers and a random number gene...

Resumo Cryptographic techniques are at the center of security solutions for wireless ad hoc networks. Public key infrastructures (PKIs) are essential for their efficient operation. However, the fully distributed organization of these networks makes a challenge to design PKIs. Changes in network paradigms and the increasing dependency on technology require more dependable and sur-vivable PKIs. T...

This paper proposes a novel scheme of group key management based on Jacobian Elliptic Chebyshev Rational Map, named Jacobian Group Key Management(JGKM). The scheme is more efficient than other group key managements since fewer re-keying messages are sent when group membership changes. Besides, it provides both forward and backward secrecy. Therefore, this proposal is helpful to deploy secure mu...

This paper describes the design, implementation, and evaluation of Mykil, which is a new key distribution protocol for secure group multicast. Mykil has been designed to be scalable to large group sizes. It is based on a combination of group-based hierarchy and key-based hierarchy systems for group key management. Important advantages of Mykil include a fast rekeying operation for large group s...

Among all security issues, key management is the most attractive mechanism to ensure security of applications and network services in Wireless Sensor Networks (WSNs). Key management includes two important aspects namely: Key distribution, which constitutes the task of distributing secret keys to nodes in the network and Key revocation, which refers to the task of securely withdrawing the key in...

Due to limited energy capacity of batteries, the function lifetime of sensor networks in general is longer than the operational lifetime of single nodes. Therefore, to keep the network working, multiple deployments of sensor nodes are needed. Due to their nature and their operational resource constraints, sensor networks are vulnerable to various types of attacks. Key pre-distribution has been ...

Wireless sensor networks have many applications, vary in size, and are deployed in a wide variety of areas. They are often deployed in potentially adverse or even hostile environment so that there are concerns on security issues in these networks. Sensor nodes used to form these networks are resource-constrained, which make security applications a challenging problem. Efficient key distribution...