Oblivious RAM: A Dissection and Experimental Evaluation
Summary: Thorough, open-source comparison of practical ORAM constructions implemented in a single library. Large-scale experiments quantify efficiency, scalability, and communication cost to guide deployment for data-management workloads in cloud environments. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhao Chang (University of Utah)
- 2. Dong Xie (University of Utah)
- 3. Feifei Li (University of Utah)
BibTeX Citation
@article{chang_vldb16,
title = {{Oblivious RAM: A Dissection and Experimental Evaluation}},
author = {Chang, Zhao and Xie, Dong and Li, Feifei},
journal = {PVLDB},
series = {{VLDB} '16},
volume = {9},
number = {12},
pages = {1113--1124},
doi = {10.14778/2994509.2994526},
url = {https://doi.org/10.14778/2994509.2994526},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,455 | Towards Practical Oblivious Join | 2022 | SIGMOD | 8.4390594e-05 |
| 5,245 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB | 6.2133532e-05 |
| 6,930 | Efficient Searchable Encryption Through Compression | 2018 | VLDB | 5.6412856e-05 |
| 10,752 | Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 115 | Executing SQL over Encrypted Data in the Database-Service-Provider Model | 2002 | SIGMOD | 0.00031742473 |
| 420 | Processing Analytical Queries over Encrypted Data | 2013 | VLDB | 0.00018540576 |
| 2,576 | Secure Database-as-a-Service with Cipherbase | 2013 | SIGMOD | 8.2748237e-05 |
| 4,279 | Querying Encrypted Data | 2014 | SIGMOD | 6.6900221e-05 |
| 7,980 | Shortest Path Computation with No Information Leakage | 2012 | VLDB | 5.4134849e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,569 | OasisDB: An Oblivious and Scalable System for Relational Data | 2025 | VLDB |
| 2 | 11,325 | GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs | 2025 | VLDB |
| 3 | 3,451 | Building Enclave-Native Storage Engines for Practical Encrypted Databases | 2021 | VLDB |
| 4 | 9,960 | Object-oriented Unified Encrypted Memory Management for Heterogeneous Memory Architectures | 2024 | SIGMOD |
| 5 | 6,930 | Efficient Searchable Encryption Through Compression | 2018 | VLDB |
| 6 | 5,245 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB |
| 7 | 2,074 | Efficient Oblivious Database Joins | 2020 | VLDB |
| 8 | 6,926 | What Storage Access Privacy is Achievable with Small Overhead? | 2019 | PODS |
| 9 | 11,444 | Towards Practical Oblivious Map | 2025 | VLDB |
| 10 | 2,455 | Towards Practical Oblivious Join | 2022 | SIGMOD |