The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Path ORAM: an extremely simple oblivious RAM protocol
Abstract
We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme for small client storage known to date. We formally prove that Path ORAM requires log^2 N / log X bandwidth overhead for block size B = X log N. For block sizes bigger than Omega(log^2 N), Path ORAM is asymptotically better than the best known ORAM scheme with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Software protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
Performance Modeling and Design of Computer Systems: Queueing Theory in Action
Harchol‐Balter, M. (2013) · Cited by 516
Towards a theory of software protection and simulation by oblivious RAMs
Goldreich, O. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28416 · Cited by 507
Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation.
Islam, M. S., Kuzu, M., & Kantarcıoğlu, M. (2012) · Cited by 491
Balls and bins: A study in negative dependence
Dubhashi, D., & Ranjan, D. (1998) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199809)13:2<99::aid-rsa1>3.0.co;2-m · Cited by 326
ObliviStore: High Performance Oblivious Cloud Storage
Stefanov, E., & Shi, E. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.25 · Cited by 248
Self-citationBuilding castles out of mud: practical access pattern privacy and correctness on untrusted storage
Williams, P., Sion, R., & Carbunar, B. (2008) · Proceedings of the 15th ACM conference on Computer and communications security · doi:10.1145/1455770.1455790 · Cited by 230
Private information storage (extended abstract)
Ostrovsky, R., & Shoup, V. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258606 · Cited by 225
PHANTOM: practical oblivious computation in a secure processor
Maas, M., Love, E., Stefanov, E., Tiwari, M., Shi, E., Asanovic, K., Kubiatowicz, J., & Song, D. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516692 · Cited by 209
Self-citationA secure processor architecture for encrypted computation on untrusted programs
Fletcher, C. W., Dijk, M. V., & Devadas, S. (2012) · Proceedings of the seventh ACM workshop on Scalable trusted computing · doi:10.1145/2382536.2382540 · Cited by 188
Self-citation
Cited by
Practical Dynamic Searchable Encryption with Small Leakage
Stefanov, E., Papamanthou, C., & Shi, E. (2014) · Proceedings 2014 Network and Distributed System Security Symposium · doi:10.14722/ndss.2014.23298 · Cited by 606
Self-citationMP-SPDZ: A Versatile Framework for Multi-Party Computation
Keller, M. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3417872 · Cited by 496
A Pragmatic Introduction to Secure Multi-Party Computation
Evans, D., Kolesnikov, V., & Rosulek, M. (2018) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000019 · Cited by 321
Smart Meter Data Privacy: A Survey
Asghar, M. R., Dan, G., Miorandi, D., & Chlamtac, I. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2720195 · Cited by 307
Data Security and Privacy in Cloud Computing
Sun, Y., Zhang, J., Xiong, Y., & Zhu, G. (2014) · International Journal of Distributed Sensor Networks · doi:10.1155/2014/190903 · Cited by 303
Metadata
- Authors
- Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., & Devadas, S.
- Venue
- Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13
- Publisher
- ACM Press
- Published
- 2013
- Pages
- 299-310
- OpenAlex
- W2170993700
- Cited by
- 698
- References
- 17
- FWCI
- 44.01
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Path ORAM: an extremely simple oblivious RAM protocol. https://app.cochat.ai/papers/10.1145/2508859.2516660
- The paper
- Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., & Devadas, S. (2013). Path ORAM: an extremely simple oblivious RAM protocol. Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13. https://doi.org/10.1145/2508859.2516660
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.