Skip to content
Conference

Feistel-based Shuffling for Enhancing Security in LSM Storage Systems

Jul 2026 · International Conference on Computer Communications and Networks · pp. 1-9 · 0 citations · 31 references

Abstract

Modern Log-Structured Merged-tree (LSM) based key-value stores achieve high performance through sequential writes and structured data organization, but this design implicitly exposes rich side-channel information at the storage layer. Even in the presence of encryption, adversaries can exploit observable artifacts, such as data placement regularity, update propagation, and inter-level transformations, to infer sensitive properties of the underlying workload. These leakages arise not from data content, but from the tight coupling between logical semantics and physical layout. We address this problem by introducing a lightweight, permutation-based obfuscation layer that randomizes data placement while preserving efficient query semantics. Our design leverages a four-round Feistel-based pseudo-random permutation, which provides strong PRP security by the Luby-Rackoff theorem to construct a keyed, invertible mapping without maintaining auxiliary mapping tables, while ensuring that storage-level representations are difficult to correlate with logical data semantics. Rather than applying randomization at a single stage, we embed the permutation mechanism throughout the data life-cycle. We further explore design variants that control the granularity and frequency of permutation to balance security guarantees with system overhead. We implement a C++ prototype and conduct controlled micro-benchmarks to evaluate the performance impact of the proposed mechanism. Results show that key transformation and block-level shuffling introduce less than 1% overhead in average operation latency for insertions, lookups, deletions, and compaction. We further provide a qualitative security analysis showing that the design eliminates key-order preservation and disrupts insertion-order locality in the storage layout. These findings suggest that Feistel-based shuffling is a lightweight and practical complement to existing encryption-based defenses for LSM-based systems.

View source

Similar papers

2026

VERDICT: A Cryptographically Verifiable Framework for Secure Data Lineage in Decentralized DAGs

This paper introduces a novel secure lineage verification system based on Directed Acyclic Graphs (DAGs) and homomorphic hash functions, VERDICT, which incorporates bucket indexing and Merkle tree verification to provide cryptographic guarantees of data and event existence.

Bilel Zaghdoudi, M. Potop-Butucaru · 0 citations
Preprint Aug 2026

Structural Leakage in Graph Encryption: Attacks and Defenses

This report systematically presents attack methodologies, defense mechanisms, security proofs, and experimental evaluations on seven real-world datasets as well as introducing BlindGES, an enhanced scheme incorporating a Merge-and-Divide mechanism and two-level multimap index that reduces one-to-one mappings to below 2...

Hua Shen, Ren-Zhi Chen, Ge Wu et al. · 0 citations
Preprint Aug 2026

Plaintext Recovery Against Post-Filtering Access Control

The results show that FGAC side-channels must be evaluated in the presence of rich predicates, which can turn membership tests into scalable reconstruction of high-entropy records.

Zachary Espiritu, David Cash · 0 citations
Preprint Aug 2026

Hiding Directions, Leaking Structure: Breaking ArrowCloak through Low-Rank Structure

This paper revisits ArrowCloak from cryptographic and structural perspectives and proposes an end-to-end, query-free recovery attack, suggesting that lightweight protection should address both per-vector geometry and joint structure across released weights.

Beijie Liu, Junyi Ouyang, Haoxuan Xu et al. · 1 citation
Preprint Sep 2026

Hoss: Fast Oblivious Semantic Search with Heterogeneous GPU-CPU-TEE Architecture

This work proposes Hoss, a first-of-its-kind oblivious semantic search system with a heterogeneous CPU-GPU TEE architecture that supports fast, scalable search with low cost of ownership and features a host-access ORAM mechanism that goes beyond traditional performance constraints and incorporates several data-dependen...

Jian Du, Wei-Jie Huang, Cheng-Hong Wang et al. · 0 citations
Preprint Sep 2026

PixCrypt: Fast Fine-Grained FHE with Range-Aware Caching

Experiments on five real-world pixel-level image processing tasks show that PixCrypt significantly improves the practicality of FHE for privacy-preserving analytics, yielding up to 35x faster fine-grained encryption and maintains IND-CPA (Indistinguishability under Chosen Plaintext Attack) security.

Chao Wang, Shu-Bing Yang, Xiao-Yan Sun et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.