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.
REF proposed a perturbation polynomial-based technique to authenticate messages.
Lightweight and Compromise-Resilient Message Authentication in Sensor Networks
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
Computer Science