{"title":"A Lightweight Certificateless Public Encryption With Multi-Keyword Search in IIoT","authors":"Jianhong Zhang, Shijun Zhou","doi":"10.1002/ett.70409","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>In Industrial IoT ecosystems, resource-constrained devices increasingly rely on searchable encryption (SE) to offload encrypted data to cloud platforms, reducing local computational burdens while preserving data privacy. However, traditional SE technologies struggle to meet the demands of IoT environments featuring large-scale distributed devices, due to cumbersome certificate management and inherent key escrow weaknesses. While certificateless searchable encryption (CLSE) schemes have been proposed to overcome these challenges, most existing solutions remain prone to security flaws and lack support for multi-keyword searches. To address these shortcomings, we present a novel lightweight certificateless public key encryption scheme with multi-keyword search capabilities (CLPSE). Crucially, compared to prior work, our protocol design does not rely on bilinear pairings, but instead employs an elliptic curve algorithm involving only scalar multiplication and addition operations. In addition, to protect the privacy between keywords and ciphertexts, we design a new matrix index structure using the BM25 retrieval algorithm and VFE function. Users can retrieve the corresponding ciphertexts using their trapdoor and threshold, which improves the flexibility of retrieval. Based on this construction, our scheme (CLPSE) is tailored for devices with limited storage and computational capacity. Compared to existing methods, it guarantees the indistinguishability of keyword ciphertexts and trapdoors, while delivering robust protection against both inside and outside keyword guessing attacks (IKGA and OKGA), thereby enhancing keyword security. Experimental results substantiate that our scheme achieves significant improvements in computational and communication efficiency over prior approaches.</p>\n </div>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"37 4","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2026-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Emerging Telecommunications Technologies","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/ett.70409","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In Industrial IoT ecosystems, resource-constrained devices increasingly rely on searchable encryption (SE) to offload encrypted data to cloud platforms, reducing local computational burdens while preserving data privacy. However, traditional SE technologies struggle to meet the demands of IoT environments featuring large-scale distributed devices, due to cumbersome certificate management and inherent key escrow weaknesses. While certificateless searchable encryption (CLSE) schemes have been proposed to overcome these challenges, most existing solutions remain prone to security flaws and lack support for multi-keyword searches. To address these shortcomings, we present a novel lightweight certificateless public key encryption scheme with multi-keyword search capabilities (CLPSE). Crucially, compared to prior work, our protocol design does not rely on bilinear pairings, but instead employs an elliptic curve algorithm involving only scalar multiplication and addition operations. In addition, to protect the privacy between keywords and ciphertexts, we design a new matrix index structure using the BM25 retrieval algorithm and VFE function. Users can retrieve the corresponding ciphertexts using their trapdoor and threshold, which improves the flexibility of retrieval. Based on this construction, our scheme (CLPSE) is tailored for devices with limited storage and computational capacity. Compared to existing methods, it guarantees the indistinguishability of keyword ciphertexts and trapdoors, while delivering robust protection against both inside and outside keyword guessing attacks (IKGA and OKGA), thereby enhancing keyword security. Experimental results substantiate that our scheme achieves significant improvements in computational and communication efficiency over prior approaches.
期刊介绍:
ransactions on Emerging Telecommunications Technologies (ETT), formerly known as European Transactions on Telecommunications (ETT), has the following aims:
- to attract cutting-edge publications from leading researchers and research groups around the world
- to become a highly cited source of timely research findings in emerging fields of telecommunications
- to limit revision and publication cycles to a few months and thus significantly increase attractiveness to publish
- to become the leading journal for publishing the latest developments in telecommunications