ECAUT: ECC-infused efficient authentication for internet of things systems based on zero-knowledge proof

被引:1
作者
Prakash, M. [1 ]
Ramesh, K. [1 ]
机构
[1] Natl Inst Technol, Comp Sci & Engn, Warangal 506004, Telangana, India
关键词
Radiofrequency identification (RFID); Authentication; BAN logic; Elliptic curve cryptography (ECC); Zero-knowledge proof;
D O I
10.1007/s11227-024-06427-9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Internet of Things (IoT) has seen significant growth, enabling connectivity and intelligence in various domains which use RFID communication most. However, this growth has also brought forth significant security challenges, particularly concerning replay attacks, which have troubled previous works. In our study, we introduce an innovative security solution that uses elliptic curve cryptography (ECC) with zero-knowledge proof (ZKP) specifically tailored for RFID-communicated applications. By leveraging ECC with ZKP, we not only improve the security of IoT systems but also reduce the persistent threat of replay attacks. Unlike traditional methods, our approach ensures that sensitive data is securely transmitted and authenticated without the risk of unauthorized duplication. We validated our approach using Scyther and BAN logic, well-known tools for assessing security protocols. These validations confirm the robustness of our solution in addressing security challenges and provide further assurance of its effectiveness in protecting IoT systems against various threats, including replay attacks. Our comprehensive analysis revealed that our approach outperforms existing solutions in terms of communication costs and computation costs. The improved efficiency in these key areas underscores the practicality and viability of our solution, further solidifying its position as a leading option for safeguarding IoT ecosystems against emerging threats.
引用
收藏
页码:25640 / 25667
页数:28
相关论文
共 23 条
[11]  
Masoumeh S., 2022, J INF SECUR APPL, V67
[12]   A lightweight authentication scheme with privacy preservation for vehicular networks [J].
Rawat, Gopal Singh ;
Singh, Karan ;
Arshad, Noreen Izza ;
Hadidi, Komeil ;
Ahmadian, Ali .
COMPUTERS & ELECTRICAL ENGINEERING, 2022, 100
[13]   A secure and privacy preserving lightweight authentication scheme for smart-grid communication using elliptic curve cryptography [J].
Sadhukhan, Dipanwita ;
Ray, Sangram ;
Obaidat, Mohammad S. ;
Dasgupta, Mou .
JOURNAL OF SYSTEMS ARCHITECTURE, 2021, 114
[14]   A lightweight remote user authentication scheme for IoT communication using elliptic curve cryptography [J].
Sadhukhan, Dipanwita ;
Ray, Sangram ;
Biswas, G. P. ;
Khan, M. K. ;
Dasgupta, Mou .
JOURNAL OF SUPERCOMPUTING, 2021, 77 (02) :1114-1151
[15]   ECCbAS: An ECC based authentication scheme for healthcare IoT systems [J].
Servati, Mohammad Reza ;
Safkhani, Masoumeh .
PERVASIVE AND MOBILE COMPUTING, 2023, 90
[16]   An efficient lightweight authentication scheme for human-centered industrial Internet of Things [J].
Singh, Jaya ;
Gimekar, Ashish ;
Venkatesan, Subramanian .
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2023, 36 (12)
[17]   A secure lightweight anonymous elliptic curve cryptography-based authentication and key agreement scheme for fog assisted-Internet of Things enabled networks [J].
Verma, Upendra ;
Bhardwaj, Diwakar .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (23)
[18]   ECC-based lightweight mutual authentication protocol for fog enabled IoT system using three-way authentication procedure [J].
Verma, Upendra ;
Bhardwaj, Diwakar .
INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2021, 24 (05) :505-516
[19]   A lightweight continuous authentication scheme for medical wireless body area networks [J].
Wan, Tao ;
Wang, Luyao ;
Liao, Weichuan ;
Yue, Shixin .
PEER-TO-PEER NETWORKING AND APPLICATIONS, 2021, 14 (06) :3473-3487
[20]   A provable secure and lightweight ECC-based authenticated key agreement scheme for edge computing infrastructure in smart grid [J].
Wang, Cong ;
Huo, Peng ;
Ma, Maode ;
Zhou, Tong ;
Zhang, Yiying .
COMPUTING, 2023, 105 (11) :2511-2537