Cloak: Heuristic ORAM Optimization Through Fixed Temporal Distribution

2026-05-26

AI Summary

Existing Oblivious RAM (ORAM) schemes suffer from high performance overhead, limiting their practicality in encrypted cloud storage due to the difficulty of simultaneously achieving strong access pattern hiding and efficiency. This work proposes a novel heuristic ORAM mechanism that leverages temporal locality, replacing the conventional assumption of perfectly uniform access distribution with a fixed yet non-uniform “recency-biased” pattern—without compromising security. The system realizes this traffic model through realistic query scheduling. Evaluated on the Netflix and Ethereum datasets, the proposed approach achieves throughput of 165,000 and 157,000 operations per second, respectively, incurring only 1.1× the performance overhead of an unencrypted baseline, thereby substantially enhancing practical deployability.

Abstract

Encrypted cloud storage can hide data contents but still leak sensitive information through access patterns. ORAM addresses this by hiding access patterns, but existing ORAM systems are too inefficient to deploy in practice. We present Cloak, an oblivious storage system that dramatically improves performance by leveraging a simple, widely observed property of real workloads: temporal locality, where recently accessed items are more likely to be accessed again soon. Instead of trying to make server accesses look perfectly uniform, Cloak makes server traffic follow a fixed, "recentness-biased" pattern and then uses real queries to fill as much of that traffic as possible. When the workload exhibits temporal locality, Cloak achieves overheads as low as $1.1\times$ over a non-oblivious and unencrypted baseline. Importantly, this heuristic affects only performance, not security. We evaluate Cloak on Netflix click-stream and Ethereum transaction traces, achieving 165,000 and 157,000 operations per second, respectively, on a single machine.

Problem

• ORAM
• access pattern leakage
• encrypted cloud storage
• performance overhead
• temporal locality

Innovation

• ORAM
• temporal locality
• oblivious storage
• heuristic optimization
• access pattern hiding