Malicious Node Detection Scheme in WSN Based on Secure Computation of Spatially Parallel Straight-Line Distance

This is the authors' abstract. We don't add key points for this paper.

With the wide applications of wireless sensor networks (WSN) in the fields of smart transportation and industrial internet of things (IIoT), there is an increasing demand for their security and trustworthiness. To solve the problem of WSN’s malicious nodes such as identity forgery attacks, node spoofing, and man-in-the-middle attacks, this paper proposes a scheme that detects malicious nodes by securely computing spatially parallel straight-line distance (SPSLD) and combining it with secure multi-party computation (MPC). This scheme uses the NTRU encryption algorithm with the additive homomorphism to design the SPSLD secure computation protocol under the semi-honest model, and for the malicious attack behaviors present in it, the secure protocol under the malicious model is proposed with the cut-and-choose method. The correctness of the protocol under different models is analyzed, and the security is proved by real/ideal model paradigm. Performance comparison and experimental simulation results indicate that, while ensuring security: The computational complexity of the semi-honest model protocol is reduced by at least 85% compared to Paillier-based schemes, with execution time shortened by 32-46%. The malicious model protocol is 12% faster than similar attack-resistant schemes, effectively defending against malicious adversary attacks, although additional overhead is introduced, its execution efficiency remains within an acceptable range for WSN environments, providing an efficient solution for enhancing the security and reliability of WSN.