In this article, we demonstrate that the asymmetric key-based architecture for securing wireless sensor networks recently introduced by Haque et al. is insecure under impersonation attack, since it does not provide authentication semantics. In addition, we show that, for the scheme to work correctly, the resulting key distribution construction should be symmetric and group-wise.

Multicasting has been widely utilized for delivering messages from one sender to multiple recipients. Nowadays in some applications such as pay per view or videoconferencing systems, the messages delivered via multicasting should be available to authorized recipients only. Therefore, secure multicasting becomes an important design issue in distributed environment. To achieve secure multicasting...

Recently, in Journal of Security and Communication Networks (5(12):1363-1374, DOI: 10.1002/ sec.429), Wang et al. proposed a group key distribution scheme with self-healing property for wireless networks in which resource is constrained. They claimed that their key distribution scheme satisfies forward security, backward security and can resist collusion attack. Unfortunately, we found some sec...

Many applications of wireless sensor network require secure data communications, especially in a hostile environment. In order to protect the sensitive data and the sensor readings, secret keys should be used to encrypt the exchanged messages between communicating nodes. Traditional asymmetric key cryptosystems are infeasible in WSN due to its low capacity at each senor node. In this paper, we ...

This paper investigates the use of the number of Goldbach triples, or the number of three prime partitions of an odd number, for use in the generation and distribution of cryptographic keys. In addition to presenting randomness properties of these triples, which turn out to be similar to that of prime partitions of even numbers, we explore the question of restricted partition sets. We propose a...

A new conference key distribution scheme is proposed in this study for access control in a hierarchy. A group of users with a different security class can generate a common secret key over a public channel so that a secure electronic conference can be held. The security classes form a hierarchy such that users in a higher security class can obtain a secret session key with users in the same or ...

Secure group key distribution and efficient rekeying is one of the most challenging security issues in sensor networks at present. In this paper, Latin square is firstly used to construct orthogonal arrays in order to obtain t-packing designs quickly. Based on cover-free family properties, t-packing designs are adopted in key predistribution phase. Then based secure key-shared method, the pre-d...

The self-healing group key distribution with revocation can deal with the session key distribution problem for secure group communication over an unreliable wireless network, with the capability of resistance to the packet loss and the collusion attack. However, since previous self-healing group key distribution schemes are restricted to m sessions, they will be reset frequently, which leads to...

The purpose of key management is to provide procedures for handling cryptographic keying material to be used in symmetric or asymmetric cryptographic mechanisms. As a result of varied design decisions appropriate to different conditions, a large variety of key distribution protocols exist. There is a need tu explicate key distribution protocols in a way that allows to understand which results t...

Wireless Sensor Networks are prone to many security attacks. The most complex among them is the node compromise attack. Networks enhanced with services like aggregation and security require a different intrusion detection mechanism than the generally used solutions and there is a possibility of a compromised node producing false intrusion detection alarms. Therefore we need suitable mechanisms ...