Light-weight Security Protocol in IoT with Less Computational Cost
DOI:
https://doi.org/10.52584/QRJ.2001.04Keywords:
Firewalls, Multi-Receiver Signcryption, Computational Cost, Communication Overhead, Hyper Elliptic Curve, IoT, smart-IoT home, Internet of ThingsAbstract
Firewalls are the emerging technology to secure the internal network resources from outsider attacks. On the other hand, Authentication, integrity, and confidentiality are the main security challenges for firewalls. To achieve these security challenges, recently, two multicast signcryption schemes have been contributed to the literature. These two Signcryption suffer from two main flaws: computational cost and our head communication. Keeping in view these two flaws, we designed a new multi-receiver signcryption scheme that is lightweight. A lightweight and well-secured protocol is presented for smart-IOT-based homes that are proven to be secured against impersonation, replay, and exposed session key attacks. The Proposed technique is experimented with using the AVISPA tool to ensure that the various attacks do not crack it. The efficiency and security of the proposed scheme are based on a hyperelliptic curve cryptosystem. The hyperelliptic curve cryptography is the subtype of an elliptic curve cryptosystem, and the key size is low from the elliptic curve. Our scheme provides all the security requirements provided by the existing multi-receiver signcryption schemes with low computational and communication costs.
Downloads
Published
Issue
Section
License
Copyright (c) 2022 Copyright (c) This is an open access article published by QUEST Research Journal. QUEST Research Journal holds the rights of all the published articles. Authors are required to transfer copyrights to journal to make sure that the article is solely published in QUEST Research Journal; however, the authors and readers may freely read, download, copy, distribute, print, search, or link to the full texts of the articles without asking prior permission from the publisher or the author.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.