Lightweight and compromise-resilient message authentication in sensor networks

Document Type

Conference Proceeding

Publication Date

9-15-2008

Abstract

Numerous authentication schemes have been proposed in the past for protecting communication authenticity and integrity in wireless sensor networks. Most of them however have following limitations: high computation or communication overhead, no resilience to a large number of node compromises, delayed authentication, lack of scalability, etc. To address these issues, we propose in this paper a novel message authentication approach which adopts a perturbed polynomial-based technique to simultaneously accomplish the goals of lightweight, resilience to a large number of node compromises, immediate authentication, scalability, and non-repudiation. Extensive analysis and experiments have also been conducted to evaluate the scheme in terms of security properties and system overhead. © 2008 IEEE.

Identifier

51349136300 (Scopus)

ISBN

[9781424420261]

Publication Title

Proceedings IEEE INFOCOM

External Full Text Location

https://doi.org/10.1109/INFOCOM.2007.200

ISSN

0743166X

First Page

2092

Last Page

2100

This document is currently not available here.

Share

COinS