OPRF Secure Computation for Safety Neighbor Verification Protocols of Wireless Sensor Networks

Abstract

Due to the resource limitations of sensor nodes, providing security protocols is a particular challenge in sensor networks. A popular proposed method is the neighborhood based key agreement protocol (NEKAP), which is an improvement over the well-known Localized Encryption and Authentication Protocol (LEAP). NEKAP is an efficient and light-weight protocol, but includes loopholes through which adversaries may launch replay attack by successfully masquerading as legitimate nodes and thereby compromise the communications over the network. In this paper, we present a modified security protocol for wireless sensor networks. Secure computation protocol for Naor-Reingold pseudorandom function was studied and a more efficient protocol was proposed based on multiplicative homomorphic encryption in this article. Based on the novel protocol, two private pattern matching protocol was designed. Also the improvement on the performance is discussed and analyzed on several typical attacks found in wireless sensor networks, i.e., replay attack. The performance verification through using a qualitative analysis indicates that our new security protocol can enhance the security resilience of wireless sensor networks better than the conventional methods.