Skip navigation

Privacy-preserving and traceable certificateless anonymous mutual authentication scheme for IoT

Privacy-preserving and traceable certificateless anonymous mutual authentication scheme for IoT

Gong, Bei, Wu, Yong, Badshah, Akhtar and Waqas, Muhammad ORCID logoORCID: https://orcid.org/0000-0003-0814-7544 (2025) Privacy-preserving and traceable certificateless anonymous mutual authentication scheme for IoT. IEEE Transactions on Dependable and Secure Computing. ISSN 1545-5971 (doi:10.1109/TDSC.2025.3597949)

[thumbnail of Author's Accepted Manuscript]
Preview
PDF (Author's Accepted Manuscript)
50937 WAQAS_Privacy-Preserving_And_Traceable_Certificateles_Anonymous_Mutual_Authentication_Scheme_For_IoT_(AAM)_2025.pdf - Accepted Version

Download (912kB) | Preview

Abstract

By utilizing the sensing and perception capabilities of various devices, the Internet of Things (IoT) enables more precise awareness of the real world, thereby enhancing management and resource utilization efficiency. However, due to their open deployment environments and frequent message exchanges, IoT endpoints are highly vulnerable to a wide range of security threats and privacy breaches, including forgery, data theft, and information leakage. Therefore, to address these challenges and ensure device legitimacy verification and secure data exchange among IoT devices, we propose a privacy-preserving and traceable certificateless anonymous mutual authentication scheme (PPT-CLAMA). PPT-CLAMA not only eliminates the need for a secure channel during key generation but also prevents attackers from tracing the real identity of devices through their own identity or public keys while providing pseudonym and anonymous authentication to devices, demonstrating greater practicality. Furthermore, through security proofs and analysis, PPT-CLAMA satisfies various high-level security properties, including mutual authentication, key agreement, nonrepudiation, unlinkability, perfect forward secrecy, known session-specific temporary information security, traceability, anonymity, and privacy preservation. The simulation results indicate that, compared to authentication and key agreement schemes, PPT-CLAMA reduces the average computational overhead and average communication overhead during the authentication process by 6.73% and 3.31%, respectively, demonstrating higher computational and communication efficiency.

Item Type: Article
Uncontrolled Keywords: Internet of Things, certificateless authentication, key agreement, privacy-preserving, security analysis.
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / School / Research Centre / Research Group: Faculty of Engineering & Science
Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Last Modified: 20 Aug 2025 06:51
URI: https://gala.gre.ac.uk/id/eprint/50937

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics