Abstract :

Searchable Encryption Has Received A Significant Attention From The Research Community With Various Constructions Being Proposed, Each Achieving Asymptotically Optimal Complexity For Specific Metrics (e.g., Search, Update). Despite Their Elegance, The Recent Attacks And Deployment Efforts Have Shown That The Optimal Asymptotic Complexity Might Not Always Imply Practical Performance, Especially If The Application Demands A High Privacy. In This Article, We Introduce A Novel Dynamic Searchable Symmetric Encryption (DSSE) Framework Called Incidence Matrix (IM)-DSSE, Which Achieves A High Level Of Privacy, Efficient Search/update, And Low Client Storage With Actual Deployments On Real Cloud Settings. We Harness An Incidence Matrix Along With Two Hash Tables To Create An Encrypted Index, On Which Both Search And Update Operations Can Be Performed Effectively With Minimal Information Leakage. This Simple Set Of Data Structures Surprisingly Offers A High Level Of DSSE Security While Achieving Practical Performance. Specifically, IM-DSSE Achieves Forward- Privacy, Backwardprivacy And Size- Obliviousness Simultaneously. We Also Create Several DSSE Variants, Each Offering Different Trade-offs That Are Suitable For Different Cloud Applications And Infrastructures. We Fully Implemented Our Framework And Evaluated Its Performance On A Real Cloud System (Amazon EC2). We Have Released IM-DSSE As An Open-source Library For Wide Development And

Published:

09-6-2025

Issue:

Vol. 25 No. 6 (2025)

Page Nos:

307-313

Section:

Articles

License:

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

How to Cite