Enhancements to ODXT SSE Scheme: Algorithm Optimization and Leakage Suppression

A Dynamic SSE (Searchable symmetric encryption) scheme should support updates and keyword searches with outsourced symmetrically encrypted data while minimizing the amount of data revealed to the untrusted server. For this purpose, literature in this field has identified two critical security properties, i.e. forward and backward privacy.In this work, we build upon the previously developed "Oblivious Dynamic Cross Tags" (ODXT) scheme for conjunctive keyword searches, featuring forward and backward privacy. The objective is to improve flexibility in the update operation of the given scheme, solve the open problem of s-term leakage, and perform leakage analysis of the improved scheme. We propose flexODXT, to reduce the time required for individual keyword update operations to a constant instead of linear complexity, and we propose suppODXT, to reduce the s-term leakage, an open problem found in ODXT.

Authors

Institutions

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/icdscnc62492.2024.10939532
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancements to ODXT SSE Scheme: Algorithm Optimization and Leakage Suppression

Syed Taqi Ali, Prathit Aswar
Distributed and Parallel Computing Systems
article

Enhancements to ODXT SSE Scheme: Algorithm Optimization and Leakage Suppression

Syed Taqi Ali, Prathit Aswar
article en

Abstract

A Dynamic SSE (Searchable symmetric encryption) scheme should support updates and keyword searches with outsourced symmetrically encrypted data while minimizing the amount of data revealed to the untrusted server. For this purpose, literature in this field has identified two critical security properties, i.e. forward and backward privacy.In this work, we build upon the previously developed "Oblivious Dynamic Cross Tags" (ODXT) scheme for conjunctive keyword searches, featuring forward and backward privacy. The objective is to improve flexibility in the update operation of the given scheme, solve the open problem of s-term leakage, and perform leakage analysis of the improved scheme. We propose flexODXT, to reduce the time required for individual keyword update operations to a constant instead of linear complexity, and we propose suppODXT, to reduce the s-term leakage, an open problem found in ODXT.

Visvesvaraya National Institute of Technology (IN)
Openalex Percentile: Top 66%
Distributed and Parallel Computing Systems
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.