Ef .cient and resilient key discovery based on pseudo-random key pre-deployment

Pietro, Roberto Di; Mancini, Luigi V.; Mei, Alessandro

doi:10.1109/ipdps.2004.1303251

Cited by 26 publications

(31 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The selective node capture attacks or smart attacks were proposed for the first time by Pietro et al in [27]. Authors proposed in this paper a new attack where the adversary greedily uses the information disclosed by compromised nodes in order to choose the next node to capture.…”

Section: Smart Node Capture Attacksmentioning

confidence: 99%

See 1 more Smart Citation

A new class of Hash-Chain based key pre-distribution schemes for WSN

Bechkit

Challal

Bouabdallah

2013

Computer Communications

View full text Add to dashboard Cite

In the last decade, we witness a proliferation of potential application domains of wireless sensor networks (WSN). Therefore, a host of research works have been conducted by both academic and industrial communities. Nevertheless, given the sensitivity of the potential applications that are generally tightly related to the physical world and may be human beings, a large scale deployment of WSN depends on the dependability provided by these emerging networks. Particularly, security emerges as a challenging issue in WSN because of the resource limitations. Key management is one of the required building blocks of many security services, such as confidentiality, authentication, etc. Unfortunately, public key based solutions, which provide efficient key management services in conventional networks, are unsuitable for WSN because of resource limitations. Symmetric key establishment is then one of the most suitable paradigms for securing wireless sensor networks. In this paper, we tackle the resiliency of symmetric key pre-distribution schemes against node capture. We propose a hash-based mechanism which enhances the resiliency of key pre-distribution for WSN. Applied to existing key predistribution schemes, our solution gives birth to enhanced schemes which are more resilient against node capture attacks. We analyze and compare our solution against the existing schemes, with respect to some important criteria such as: the network resiliency against node capture, secure connectivity coverage, storage requirement, communication overhead and computation complexity. We show through analytical analysis that our solution enhances the network resiliency without introducing any new storage or communication overheads. Moreover, we show that our solution introduces insignificant computational overhead.

show abstract

Section: Smart Node Capture Attacksmentioning

confidence: 99%

“…Pietro et al proposed in [27][29] an efficient and secure shared key discovery way trading off communications for local computations. In the proposed solution, each node i is pre-loaded with keys from the global pool such as :…”

Section: Smart Node Capture Attacksmentioning

confidence: 99%

A new class of Hash-Chain based key pre-distribution schemes for WSN

Bechkit

Challal

Bouabdallah

2013

Computer Communications

View full text Add to dashboard Cite

show abstract

“…While these symmetric-key-based schemes are computationally efficient, the trade-off has to be paid for complicated key pre-distribution and key management, which incur large communication overhead during the key discovery. In their recent work [19], Di Pietro et al proposed an interesting key discovery scheme based on pseudorandom key pre-deployment. The scheme leverages the hash computation to find the matching keys so that the communications for key index exchanges in [7] can be avoided.…”

Section: Related Workmentioning

confidence: 99%

Public-key based access control in sensornet

et al. 2011

View full text Add to dashboard Cite

Symmetric cryptography has been mostly used in security schemes in sensor networks due to the concern that public key cryptography (PKC) is too expensive for sensor devices. While these schemes are efficient in processing time, they generally require complicated key management, which may introduce high memory and communication overhead. On the contrary, PKC-based schemes have simple and clean key management, but cost more computational time. The recent progress in PKC implementation, specially elliptic curve cryptography (ECC), on sensors motivates us to design a PKC-based security scheme and compare its performance with the symmetric-key counterparts. This paper proposes a practical PKC-based access control for sensor networks, which consists of pairwise key establishment, local access control, and remote access control. We have implemented both cryptographic primitives on commercial off-the-shelf sensor devices. Building the user access control as a case study, we show that PKC-based protocol is more advantageous than those built on symmetric cryptography in terms of the memory usage, message complexity, and security resilience. Meanwhile, our work also provides insights in integrating and designing PKC-based security protocols for sensor networks.

show abstract

“…If two nodes are in each other's communication range and they share a common key, then they can encrypt the messages between them using the shared key and hence establish a secure link. A large number of key predistribution schemes have been proposed in the literature, e.g., [8,3,14,2,15,7,18].…”

Section: Introductionmentioning

confidence: 99%

Three Improved Algorithms for Multipath Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission

Stinson

2011

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

In this paper, we propose a security model to capture active attacks against multi-path key establishment (MPKE) in sensor networks. Our model enhances previous models to capture more attacks and achieve essential security goals for multi-path key establishment. In this model, we can apply protocols for perfectly secure message transmission to solve the key establishment problem. We propose a new protocol for optimal one-round perfectly secure message transmission based on Reed-Solomon codes. Then we use this protocol to obtain two new multipath key establishment schemes that can be applied provided that fewer than one third of the paths contain an adversary node. Finally, we describe another MPKE scheme that tolerates a higher fraction (less than 1/2) of paths controlled by the adversary. This scheme is based on a new protocol for a weakened version of message transmission, which is very simple and efficient.Our multi-path key establishment schemes achieve improved security and lower communication complexity, as compared to previous schemes.

show abstract

Ef .cient and resilient key discovery based on pseudo-random key pre-deployment

Cited by 26 publications

References 23 publications

A new class of Hash-Chain based key pre-distribution schemes for WSN

A new class of Hash-Chain based key pre-distribution schemes for WSN

Public-key based access control in sensornet

Three Improved Algorithms for Multipath Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission

Contact Info

Product

Resources

About