A scalable key pre‐distribution mechanism for large‐scale wireless sensor networks

Shen, An-Ni; Guo, Song; Chien, Hung Yu; Guo, Minyi

doi:10.1002/cpe.1429

Cited by 6 publications

(5 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computational burden due to the key distribution phase is sustainable by sensor nodes as the process only needs to be performed once at the beginning. Detailed description of such schemes is out of the scope of our proposal, but the interested reader can find all the technical details in .…”

Section: Theoretical and Experimental Assessmentmentioning

confidence: 99%

Secure random number generation in wireless sensor networks

Milazzo

Ortolani

2014

Concurrency and Computation

View full text Add to dashboard Cite

The increasing adoption of wireless sensor networks as a flexible and inexpensive tool for the most diverse applications, ranging from environmental monitoring to home automation, has raised more and more attention to the issues related to the design of specifically customized security mechanisms. The scarcity of computational, storage, and bandwidth resources cannot definitely be disregarded in such context, and this makes the implementation of security algorithms particularly challenging. This paper proposes a security framework for the generation of true random numbers, which are paramount as the core building block for many security algorithms; the intrinsic nature of wireless sensor nodes and their capability of reliably providing measurements of environmental quantities make them natural candidates as true random number generators. In order to provide robustness to common attacks, we additionally devised a protocol aimed at obscuring the actual source of data, by making nodes cooperate with their neighbors. Furthermore, we describe an enhanced version of our framework consisting in an optimization for use in the context of resource-constrained systems. SECURE RANDOM NUMBER GENERATION IN WIRELESS SENSOR NETWORKS 3843 the produced sequences show some periodicity and are actually reproducible. The attacker could in principle collect generated random numbers until the sequence restarts and then deterministically predict the rest of the sequence; a common used countermeasure consists in periodically changing the key after a certain time interval. PRNGs are widely used because they ensure good statistical properties and high bit rates; however, their viability completely depends on the actual randomness of the initialization seeds.As the name suggests, the physical approach relies on measurements related to physical phenomena; in this case, random numbers are generated as a function of a set of samples coming from sensory readings, and the generator is named a true random number generator (TRNG), because the sequence is actually non-deterministic and unpredictable. TRNGs do not need seeds nor secret keys and do not exhibit periodicity because of the independence of the current random number from its past values. TRNGs usually require post-processing operations because they often do not ensure sufficiently good statistical properties, so they are intrinsically characterized by lower bit rates with respect to the PRNGs counterpart. TRNGs are thus often used as random seed generators for PRNGs because they are too slow for standalone usage in applications requiring high-bit-rate random sequences.However, secure applications in the specific context of WSNs seldom require high-bit-rate random sequences; we will thus focus on TRNGs as the basic building block for a security infrastructure for WSNs.Moreover, sensor nodes are obvious candidates as data providers for TRNGs, because their natural purpose is to collect great amount of data for environmental monitoring. As reported in the recent literature, many of the typic...

show abstract

Section: Theoretical and Experimental Assessmentmentioning

confidence: 99%

Secure random number generation in wireless sensor networks

Milazzo

Ortolani

2014

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The basic idea of the AP key management scheme is to preload a large number of keys in each CH while only pre-loads a small number of keys in each SN. Shen et al proposed the recent deterministic hierarchical scheme which is based on polynomial key calculations mechanism such that each network node is preloaded with a number of polynomial coefficients (g j ) [17]. A Low-Energy Key Management (LEKM) protocol is a probabilistic key management scheme proposed by Gaurave et al [18].…”

Section: Key Management Schemes Of Hierarchical Wsnsmentioning

confidence: 99%

“…To explore the advantages of our proposed key management scheme, it should be evaluated or in other words should be compared with other previous proposed schemes. In this section, we will analyze the security properties of our proposed scheme comparatively with LEAP scheme [15] which is considered the basic hierarchical key management scheme in WSNs, and with both of Kausar et al scheme [19] and Shen et al scheme [17] which are the most recent hierarchy schemes in WSNs.…”

Section: Evaluation Of Our Proposed Schemementioning

confidence: 99%

See 1 more Smart Citation

Secure, Scalable, and Efficient Key Management Scheme for Wireless Sensor Networks (WSNs)

Soliman

Abdelhafez

Anis

2011

International Conference on Aerospace Sciences and Aviation Tec

View full text Add to dashboard Cite

In Wireless sensor networks (WSNs), key management is the core issue of any security approaches. The main challenge in WSNs key management is how to distribute and manage secret keys within WSN nodes. Several schemes are proposed for this purpose. Another challenge which was not tackled by most of the proposed schemes is the behavior of network in case of nodes capturing, since once any node is captured by an adversary, all the information stored in its memory could be compromised. In this paper we propose a key management scheme for hierarchical WSNs. In addition; we propose a mechanism concerning adding of new sensor nodes, and keys revocation and re-keying processes to overcome nodes capturing crisis. Then we will evaluate the secrecy of our scheme by analyzing the security properties of our proposed scheme with other previous proposed schemes.

show abstract

“…Wireless sensor networks (WSN) consist of a sink, a large number of randomly deployed sensor nodes for gathering local data, and a possible set of authorized users. In such a WSN, the sink may broadcast control commands to sensor nodes to facilitate normal operation of WSNs, and the authorized users could send broadcast requests to query the latest data collected by sensors [1][2][3][4][5]. However, users might be compromised and behave maliciously [6,7], and attackers might flood bogus messages to exhaust these resourceconstrained sensor nodes and then devastate the WSNs.…”

Section: Introductionmentioning

confidence: 99%

Comments on IMBAS: identity‐based multi‐user broadcast authentication in wireless sensor networks

Chien

Lee

2012

Security Comm Networks

View full text Add to dashboard Cite

In 2008, Cao et al. proposed an identity-based multi-user broadcast authentication scheme (called IMBAS) for wireless sensor networks. The IMBAS consists of one elliptic curve-based signature scheme, called variant of Bellare-NamprempreNeven' Identity-Based Signature (vBNN-IBS), for user broadcast authentication; a new Schnorr signature with partial message recovery for sink broadcast authentication; and a password-based private key protection to eliminate the threat caused by possible user device compromise. Compared with its counterparts, IMBAS owns better performance in terms of security, scalability, and efficiency. Unfortunately, this letter will show that (1) the password-based protection scheme and the vBNN-IBS scheme are not secure-a compromised user device will disclose the user private key-and (2) the new Schnorr signature with partial message recovery is vulnerable to existential forgery attack.

show abstract

A scalable key pre‐distribution mechanism for large‐scale wireless sensor networks

Cited by 6 publications

References 26 publications

Secure random number generation in wireless sensor networks

Secure random number generation in wireless sensor networks

Secure, Scalable, and Efficient Key Management Scheme for Wireless Sensor Networks (WSNs)

Comments on IMBAS: identity‐based multi‐user broadcast authentication in wireless sensor networks

Contact Info

Product

Resources

About