Multi-User Searchable Encryption Scheme for IoT Scenarios Based on Bloom Filter
Uložené v:
| Názov: | Multi-User Searchable Encryption Scheme for IoT Scenarios Based on Bloom Filter |
|---|---|
| Autori: | YI Qiuzhi, TANG Hongbo, QIU Hang |
| Zdroj: | Jisuanji gongcheng, Vol 51, Iss 7, Pp 254-262 (2025) |
| Informácie o vydavateľovi: | Editorial Office of Computer Engineering, 2025. |
| Rok vydania: | 2025 |
| Zbierka: | LCC:Computer engineering. Computer hardware LCC:Computer software |
| Predmety: | searchable encryption algorithm, multi-keyword encryption algorithm, bloom filter, diffle-hellman assumption, discrete logarithm problem, Computer engineering. Computer hardware, TK7885-7895, Computer software, QA76.75-76.765 |
| Popis: | Searchable encryption technology utilizes extracted keywords as indexes to search for specific documents within a document collection. However, existing searchable encryption schemes suffer from the issues of significantly increased resource consumption with an increased number of keywords and the inability to allow index collisions in multi-user scenarios. To address the limitations of the current schemes, a searchable encryption scheme for multi-user and multi-keyword scenarios in Internet of Things (IoT) environments is proposed. Leveraging the characteristics of Bloom filters, a memory-efficient vector is employed as an index for grouping document collections, thereby enhancing the efficiency of searchable encryption while permitting index collisions. A verification ciphertext generated from encrypted keywords is used to verify whether the trapdoor contains the keywords present in a document, thereby enabling users to locate matching documents within the shared-index document collection. Based on the discrete logarithm's hardness and the Diffie-Hellman problems, the proposed scheme requires fewer computational operations for ciphertext generation at each stage. Theoretical analysis and experimental results demonstrate that the scheme is both feasible and secure, with reduced communication overhead when compared with alternative approaches. |
| Druh dokumentu: | article |
| Popis súboru: | electronic resource |
| Jazyk: | English Chinese |
| ISSN: | 1000-3428 |
| Relation: | https://www.ecice06.com/fileup/1000-3428/PDF/jsjgc-51-7-254.pdf; https://doaj.org/toc/1000-3428 |
| DOI: | 10.19678/j.issn.1000-3428.0069220 |
| Prístupová URL adresa: | https://doaj.org/article/f8f9c86ed0b84c728bbd08d666ba2726 |
| Prístupové číslo: | edsdoj.f8f9c86ed0b84c728bbd08d666ba2726 |
| Databáza: | Directory of Open Access Journals |
Nájsť tento článok vo Web of Science | Abstrakt: | Searchable encryption technology utilizes extracted keywords as indexes to search for specific documents within a document collection. However, existing searchable encryption schemes suffer from the issues of significantly increased resource consumption with an increased number of keywords and the inability to allow index collisions in multi-user scenarios. To address the limitations of the current schemes, a searchable encryption scheme for multi-user and multi-keyword scenarios in Internet of Things (IoT) environments is proposed. Leveraging the characteristics of Bloom filters, a memory-efficient vector is employed as an index for grouping document collections, thereby enhancing the efficiency of searchable encryption while permitting index collisions. A verification ciphertext generated from encrypted keywords is used to verify whether the trapdoor contains the keywords present in a document, thereby enabling users to locate matching documents within the shared-index document collection. Based on the discrete logarithm's hardness and the Diffie-Hellman problems, the proposed scheme requires fewer computational operations for ciphertext generation at each stage. Theoretical analysis and experimental results demonstrate that the scheme is both feasible and secure, with reduced communication overhead when compared with alternative approaches. |
|---|---|
| ISSN: | 10003428 |
| DOI: | 10.19678/j.issn.1000-3428.0069220 |