Efficient smart home message verification protocol based on Chebyshev chaotic mapping

Vincent Omollo Nyangaresi

doi:10.1016/j.comnet.2026.112033

Efficient smart home message verification protocol based on Chebyshev chaotic mapping

2026-01-20

0

PRE

AI

V

Vincent Omollo Nyangaresi

M

Mohd Shariq

D

Daisy Nyang’anyi Ondwari

DOI：10.1016/j.comnet.2026.112033

Original

Original request for help

Save

Abstract

En 中文

Smart home networks deploy a myriad of sensors and intelligent devices to collect and disseminate massive and sensitive data, facilitating task automations for enhancing comfort, quality of life, efficiency, and sustainability. However, the utilisation of public channels for interactions between users and smart home devices raises serious privacy and security issues. Numerous authentication schemes have been proposed in recent literature; most of them are prone to security attacks, including offline guessing, privileged insiders, and impersonation. In addition, some of them have complicated architectures that result in high resource consumption. In this paper, efficient Chebyshev polynomials and hashing functions are leveraged to develop a robust authentication protocol for smart homes. The Burrows–Abadi–Needham (BAN) logic-based detailed formal security analysis confirms the robustness of the joint authentication and key negotiation procedures. In addition, informal security analysis shows that the proposed protocol is secure against the Dolev-Yao (D-Y) and Canetti and Krawczyk (C-K) adversary models, mitigating several known security attacks. In terms of performance, the developed scheme incurs relatively low computation, energy, and communication costs.

Efficient smart home message verification protocol based on Chebyshev chaotic mapping

Abstract

Journal

Organization