.png){kind=icon}
.png){kind=icon}
Return
Enhancing Tree-Based ORAM Using Batched Request Reordering
.png){kind=icon}
PRE
AI
DOI：10.1109/TIFS.2017.2762824.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We explore a new design space for tree-based oblivious RAM (ORAM) constructions, which has not received much attention from the research community. Concretely, our approach is to dynamically reorder the sequence of input requests into batches, such that the portion of the paths shared by the requests in the batch is maximized. In this way, the amount of data fetched per ORAM access can be significantly diminished, thus saving I/O bandwidth. Our results show that the average performance gain is of between 5%-35% over the baseline ORAM, even in real workloads with causal dependencies, which confirms the practical utility of dynamic batching.
Keywords:
Oblivious RAM
batching
cloud storage
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
5.2K
Citations:
2.3W