A Certificateless Authentication Scheme Based on Zero-Divisor Graph for IoT

Le résumé fourni par la source

The deployment of the IoT necessitates authentication mechanisms that are both lightweight and secure, particularly for resource-constrained devices. While traditional Public Key Infrastructure (PKI) and Identity-Based Cryptography (IBC) are hindered by certificate management and key escrow issues, early certificateless signature (CLS) schemes often rely on computationally expensive bilinear pairings. To address these limitations, this paper proposes a novel pairing-free certificateless authentication scheme based on triple zero-divisor graph sequences. The proposed approach integrates three key contributions: firstly, a honeyword generation mechanism that creates mathematically linked fake identities to detect insider attacks and credential leakage; secondly, a lightweight CLS protocol that replaces bilinear pairings with efficient elliptic curve operations; thirdly, a distributed gateway architecture enabling context-aware risk assessment and batch authentication. Security analysis under the Random Oracle Model confirms the scheme’s robustness. Experimental evaluation demonstrates its practicality for IoT systems, achieving a verification time of 3.929 ms and a communication overhead of 98 bytes.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.