A Formally Validated Authentication Algorithm for Secure Message Forwarding in Smart Home Networks

• Published in: SN computer science Vol. 3; no. 5; p. 364
• Main Author: Nyangaresi, Vincent Omollo
• Format: Journal Article
• Language: English
• Published: Singapore Springer Nature Singapore 01.09.2022; Springer Nature B.V
• Subjects: Algorithms; Authentication; Communication; Computer Imaging; Computer Science; Computer systems; Computer Systems Organization and Communication Networks; Cryptography; Curves; Data Structures and Information Theory; Electronic devices; Energy storage; Information Systems and Communication Service; Messages; Neural networks; Original Research; Pattern Recognition and Graphics; Privacy; Security; Sensors; Smart buildings; Smart houses; Software Engineering/Programming and Operating Systems; Vision; Symmetric key; Privacy; Authentication; Elliptic curve; Attacks; Security; Algorithm; IoT
• ISSN: 2661-8907; 2662-995X; 2661-8907
• DOI: 10.1007/s42979-022-01269-9

The many devices connected in smart homes increase the attack surfaces from which adversaries can invade the network. In addition, majority of these smart devices have numerous vulnerabilities that can be exploited to wreck havoc in smart homes. As such, a myriad of security schemes have been presented based on technologies such as bilinear pairing operations, public key infrastructure, blockchains and elliptic curve cryptosystems. However, some of these protocols are not robust against conventional smart home attacks. In addition, some of the deployed techniques inadvertently result in excessive processing at the smart devices. It is, therefore, imperative that provably secure protocols be developed to offer efficiency and sufficient protection to the exchanged packets. In this paper, an elliptic curve symmetric key-based algorithm for secure message forwarding is presented. Formal security verification is executed using the Burrows–Abadi–Needham (BAN) logic which demonstrates strong mutual authentication and session negotiation among the communicating entities. In addition, the informal security analysis carried out shows the robustness of this scheme under the Canetti–Krawczyk threat model. Moreover, it is relatively efficient in terms of storage, communication, energy and computation requirements.