Multi-User Searchable Encryption Scheme for IoT Scenarios Based on Bloom Filter

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 i...

Full description

Saved in:
Bibliographic Details
Published in:Ji suan ji gong cheng Vol. 51; no. 7; pp. 254 - 262
Main Author: YI Qiuzhi, TANG Hongbo, QIU Hang
Format: Journal Article
Language:Chinese
English
Published: Editorial Office of Computer Engineering 01.07.2025
Subjects:
searchable encryption algorithm|multi-keyword encryption algorithm|bloom filter|diffle-hellman assumption|discrete logarithm problem
ISSN:1000-3428
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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:1000-3428
DOI:10.19678/j.issn.1000-3428.0069220