An efficient broadcast authentication scheme in wireless sensor networks

Chang, S.-F.; Shieh, Shiuh-Pyng; Lin, Warren W.; Hsieh, Chih-Ming

doi:10.1145/1128817.1128864

Cited by 47 publications

(12 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Schemes proposed in [16,17,18,19,20] are based on one-time signature mechanism. Those schemes are computationally efficient as signatures only rely on one-way functions without trapdoors.…”

Section: Related Workmentioning

confidence: 99%

Fast authentication in wireless sensor networks

Benzaid

Lounis

Al-Nemrat³

et al. 2016

Future Generation Computer Systems

View full text Add to dashboard Cite

Broadcast authentication is a fundamental security service in wireless sensor networks (WSNs). Although symmetric-key-based µTESLA-like schemes were employed due to their energy efficiency, they all suffer from DoS attacks resulting from the nature of delayed message authentication. Recently, several public-key-based schemes were proposed to achieve immediate broadcast authentication that may significantly improved security strength. However, while the public-key-based schemes obviate the security vulnerability inherent to symmetric-key-based µTESLA-like schemes, their signature verification is time-consuming. Thus, speeding up signature verification is a problem of considerable practical importance, especially in resource-constrained environments. This paper exploits the cooperation among sensor nodes to accelerate the signature verification of vBNN-IBS, a pairing-free identity-based signature with reduced signature size. We demonstrate through on extensive performance evaluation study that the accelerated vBNN-IBS achieves the longest network lifetime compared to both the traditional vBNN-IBS and the accelerated ECDSA schemes. The accelerated vBNN-IBS runs 66% faster than the traditional signature verification method. Results from theoretical analysis, simulation, and real-world experimentation on a MICAz platform are provided to validate our claims.

show abstract

“…Schemes proposed in [16,17,18,19,20] are based on one-time signature mechanism. Those schemes are computationally efficient as signatures only rely on one-way functions without trapdoors.…”

Section: Related Workmentioning

confidence: 99%

Fast authentication in wireless sensor networks

Benzaid

Lounis

Al-Nemrat³

et al. 2016

Future Generation Computer Systems

View full text Add to dashboard Cite

show abstract

“…There exist several approaches and improvements for authentication based on one time signatures. Besides the one applied by us [11], Chang et al propose improvements for efficient broadcast authentication in wireless sensor networks [5]. An approach and tool for modeling safety and security interdependencies via Boolean logic Driven Markov Processes (BDMP) is shown in [9], following the analysis method known from fault and attack trees.…”

Section: Related Workmentioning

confidence: 99%

Quantitative Safety and Security Analysis from a Communication Perspective

Malinowsky

Schwefel²,

Jung³

2015

Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

This paper introduces and exemplifies a trade-off analysis of safety and security properties in distributed systems. The aim is to support analysis for real-time communication and authentication building blocks in a wireless communication scenario. By embedding an authentication scheme into a real-time communication protocol for safety-critical scenarios, we can rely on the protocol's individual safety and security properties. The resulting communication protocol satisfies selected safety and security properties for deployment in safety-critical use-case scenarios with security requirements. We look at handover situations in a IEEE 802.11 wireless setup between mobile nodes and access points. The tradeoffs involve application-layer data goodput, probability of completed handovers, and effect on usable protocol slots, to quantify the impact of security from a lower-layer communication perspective on the communication protocols. The results are obtained using the network simulator ns-3.

show abstract

“…First, in applications where the receivers are resource constrained, the public key size of HORS is too large, which means a high storage overhead at the receiver side. Though some recent work [3] improves the public key size of HORS, the scheme cannot be applied to one-way chain based authentication protocols [19], [20], [28] and thus the distribution of the public key becomes an issue. Second, the signature size of HORS is too large for the wide area protection application.…”

Section: E Literature Reviewmentioning

confidence: 99%

Multicast Authentication in the Smart Grid With One-Time Signature

Cao

2011

IEEE Trans. Smart Grid

158

View full text Add to dashboard Cite

Abstract-Multicast has been envisioned to be useful in many smart grid applications such as demand-response, wide area protection, in-substation protection and various operation and control. Since the multicast messages are related to critical control, authentication is necessary to prevent message forgery attacks. In this paper, we first identify the requirements of multicast communication and multicast authentication in the smart grid. Based on these requirements, we find that one-time signature based multicast authentication is a promising solution, due to its short authentication delay and low computation cost. However, existing one-time signatures are not designed for the smart grid and they may have high storage and bandwidth overhead. To address this problem, we propose a new one-time signature scheme which can reduce the storage cost by a factor of 8 and reduce the signature size by 40% compared with existing schemes. Thus, our scheme is more appropriate for smart grid applications where the receivers have limited storage (e.g., home appliances and field devices) or where data communication is frequent and short (e.g., phasor data). These gains are at the cost of increased computations in signature generation and/or verification and fortunately our scheme can flexibly allocate the computations between the sender and receiver based on their computing resources. We formulate the computation allocation as a nonlinear integer programming problem to minimize the signing cost under a certain verification cost and propose a heuristic solution to solve it.

show abstract

An efficient broadcast authentication scheme in wireless sensor networks

Cited by 47 publications

References 10 publications

Fast authentication in wireless sensor networks

Fast authentication in wireless sensor networks

Quantitative Safety and Security Analysis from a Communication Perspective

Multicast Authentication in the Smart Grid With One-Time Signature

Contact Info

Product

Resources

About