Dynamic Adaptive Bloom Filter Based Privacy-Preserving Phrase Search for Encrypted Iot Cloud Data

The use of IoT devices in huge numbers results in massive amounts of sensitive data being outsource into cloud storage systems, making it necessary to design efficient search schemes over such encrypted data. Phrase Search allows users to retrieve their documents by matching exact sequences of keywords, but existing solutions have not found a good balance between search time, storage space, and privacy loss due to their static design. In this work, we propose an efficient Dynamic Adaptive Bloom Filter based Privacy-Preserving Phrase Search (DABF-PPS) scheme for encrypted IoT cloud data. We introduce a dynamic parameter optimization method to adaptively adjust Bloom filters according to document set properties and queries. A hierarchical n-gram Bloom filter index is designed to allow phrase searches without exposing keyword locations. Furthermore, our solution supports dynamic updating of indices with the help of counting Bloom filter structures and lazy deletion. Our security analysis proves that our solution provides forward and limited backward privacy against chosen-keyword attacks. Our experiments on real-world IoT datasets show that our approach decreases search time and storage space while maintaining acceptable false-positive rates.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-31
DOI
https://doi.org/10.5281/zenodo.23834234
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Adaptive Bloom Filter Based Privacy-Preserving Phrase Search for Encrypted Iot Cloud Data

Sphoorthy Reddy Surakanti, Dr. S. Ramachandram
Zenodo (CERN European Organization for Nuclear Research)
Cryptography and Data Security
article

Dynamic Adaptive Bloom Filter Based Privacy-Preserving Phrase Search for Encrypted Iot Cloud Data

Sphoorthy Reddy Surakanti, Dr. S. Ramachandram
article en

Abstract

The use of IoT devices in huge numbers results in massive amounts of sensitive data being outsource into cloud storage systems, making it necessary to design efficient search schemes over such encrypted data. Phrase Search allows users to retrieve their documents by matching exact sequences of keywords, but existing solutions have not found a good balance between search time, storage space, and privacy loss due to their static design. In this work, we propose an efficient Dynamic Adaptive Bloom Filter based Privacy-Preserving Phrase Search (DABF-PPS) scheme for encrypted IoT cloud data. We introduce a dynamic parameter optimization method to adaptively adjust Bloom filters according to document set properties and queries. A hierarchical n-gram Bloom filter index is designed to allow phrase searches without exposing keyword locations. Furthermore, our solution supports dynamic updating of indices with the help of counting Bloom filter structures and lazy deletion. Our security analysis proves that our solution provides forward and limited backward privacy against chosen-keyword attacks. Our experiments on real-world IoT datasets show that our approach decreases search time and storage space while maintaining acceptable false-positive rates.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 13%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon