scispace - formally typeset
Proceedings ArticleDOI

Defending DoS Attacks on Broadcast Authentication in Wireless Sensor Networks

Reads0
Chats0
TLDR
This paper presents an effective and efficient scheme that can defend such DoS attack on broadcast authentication, and performance evaluation shows that the scheme is much more secure and efficient than an existing scheme.
Abstract
Security is critical for wireless sensor networks deployed in military, homeland security and other hostile environments. In this paper, we study a security issue related with broadcast in sensor networks. Due to the broadcast nature of wireless communications, often it is more efficient to broadcast packets to sensor nodes. Typically, broadcast authentication is achieved by digital signatures. Since digital signature operations are expensive for small sensor nodes, an attacker can launch a serious denial of service (DoS) attack. That is, an attacker may forge a large number of broadcast messages with digital signatures, and then force sensor nodes to verify these signatures, which can cause them run out of power. In this paper, we present an effective and efficient scheme that can defend such DoS attack on broadcast authentication. Our performance evaluation shows that the scheme is much more secure and efficient than an existing scheme.

read more

Citations
More filters

Efficient KCC Broadcast Authentication Scheme in WSN"s

P. Prema, +1 more
TL;DR: Koblitz introduced a family of curves which admit especially fast elliptic scalar multiplication which is also the most demanding operation due to its efficient computation which is widely used in practical cryptosystems.
Journal ArticleDOI

RFA: R-Squared Fitting Analysis Model for Power Attack

TL;DR: This paper proposes -squared fitting model analysis (RFA) which is more appropriate for nonlinear correlation analysis and can be applied to other side-channel methods such as second-order CPA and collision-correlation power attack.
Journal ArticleDOI

Dynamic Message Puzzle as Pre-Authentication Scheme in Wireless Sensor Networks

TL;DR: The Dynamic Message Puzzle scheme that uses the power of first quartile (Q1power1) and the exponential of second quartiles (Q2exp) threshold functions to limit the maximum number of hash iterations for each puzzle construction can decrease sender-side delay by at least 60%.
Journal ArticleDOI

Extracting entity-based information in cyber-physical systems:

TL;DR: Experimental results are reported, which show that P 3 E can provide an effective and efficient solution to the entity extraction problem.
Proceedings ArticleDOI

Implementation of Backward Key Chain and Hill Cipher for Securing Messages in the Wireless Sensor Networks

TL;DR: In this paper , a modification of the broadcast authentication scheme by adding confidentiality to the session key and message is proposed, which is produced by a backward key chain, secured with a modified hill cipher encryption.
References
More filters
Journal ArticleDOI

Elliptic curve cryptosystems

TL;DR: The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.
Proceedings ArticleDOI

Range-free localization schemes for large scale sensor networks

TL;DR: In this paper, the authors present APIT, a novel localization algorithm that is range-free, which performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired.
Proceedings ArticleDOI

The flooding time synchronization protocol

TL;DR: The FTSP achieves its robustness by utilizing periodic flooding of synchronization messages, and implicit dynamic topology update and comprehensive error compensation including clock skew estimation, which is markedly better than that of the existing RBS and TPSN algorithms.
Book

Elliptic Curves in Cryptography

TL;DR: In the past few years elliptic curve cryptography has moved from a fringe activity to a major challenger to the dominant RSA/DSA systems as mentioned in this paper, and it has become all pervasive.
Journal Article

Comparing elliptic curve cryptography and RSA on 8-bit CPUs

TL;DR: In this paper, an Atmel ATmega128 at 8 MHz was used to implement ECC point multiplication over fields using pseudo-Mersenne primes as standardized by NIST and SECG.
Related Papers (5)