{"title":"TF-LB-CLPAS: Trapdoor-Free Lattice-Based Certificateless Public Auditing Scheme for Cloud-Assisted IoT","authors":"Renuka Cheeturi, Syam Kumar Pasupuleti, Rashmi Ranjan Rout","doi":"10.1002/cpe.70923","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Cloud-assisted IoT systems increasingly rely on certificateless public auditing (CLPA) mechanisms to ensure the integrity of outsourced data stored in the cloud while avoiding certificate management and key escrow issues. However, most existing CLPA schemes are built on conventional cryptographic assumptions and are therefore vulnerable to quantum attacks. To resist quantum adversaries, several lattice-based CLPA schemes (LB-CLPAS) have been proposed. Nevertheless, these schemes typically rely on complex lattice trapdoor constructions and adopt integer or ideal lattices, resulting in high computational overhead and rendering them impractical for resource-constrained IoT systems. To address these limitations, this paper proposes a trapdoor-free lattice-based certificateless public auditing scheme for cloud-assisted IoT (TF-LB-CLPAS). By eliminating complex trapdoors and adopting module lattices, the scheme significantly improves computational efficiency while maintaining strong post-quantum security. Security is formally proven under the Module-SIS and Module-LWE assumptions. Performance evaluations demonstrate lower computational overhead and superior practicality compared to existing trapdoor-based LB-CLPAS, making it well suited for cloud-assisted IoT devices.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 17","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2026-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70923","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
Cloud-assisted IoT systems increasingly rely on certificateless public auditing (CLPA) mechanisms to ensure the integrity of outsourced data stored in the cloud while avoiding certificate management and key escrow issues. However, most existing CLPA schemes are built on conventional cryptographic assumptions and are therefore vulnerable to quantum attacks. To resist quantum adversaries, several lattice-based CLPA schemes (LB-CLPAS) have been proposed. Nevertheless, these schemes typically rely on complex lattice trapdoor constructions and adopt integer or ideal lattices, resulting in high computational overhead and rendering them impractical for resource-constrained IoT systems. To address these limitations, this paper proposes a trapdoor-free lattice-based certificateless public auditing scheme for cloud-assisted IoT (TF-LB-CLPAS). By eliminating complex trapdoors and adopting module lattices, the scheme significantly improves computational efficiency while maintaining strong post-quantum security. Security is formally proven under the Module-SIS and Module-LWE assumptions. Performance evaluations demonstrate lower computational overhead and superior practicality compared to existing trapdoor-based LB-CLPAS, making it well suited for cloud-assisted IoT devices.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.