The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound
Abstract
We propose a new tree-based ORAM scheme called Circuit ORAM. Circuit ORAM makes both theoretical and practical contributions. From a theoretical perspective, Circuit ORAM shows that the well-known Goldreich-Ostrovsky logarithmic ORAM lower bound is tight under certain parameter ranges, for several performance metrics. Therefore, we are the first to give an answer to a theoretical challenge that remained open for the past twenty-seven years. Second, Circuit ORAM earns its name because it achieves (almost) optimal circuit size both in theory and in practice for realistic choices of block sizes. We demonstrate compelling practical performance and show that Circuit ORAM is an ideal candidate for secure multi-party computation applications.
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
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Cited by
ObliVM: A Programming Framework for Secure Computation
Liu, C., Wang, X. S., Nayak, K., Huang, Y., & Shi, E. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.29 · Cited by 307
Self-citationSoK: SGX.Fail: How Stuff Gets eXposed
Van Schaik, S., Seto, A., Yurek, T., Batori, A., AlBassam, B., Genkin, D., Miller, A., Ronen, E., Yarom, Y., & Garman, C. (2024) · 2024 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp54263.2024.00260 · Cited by 31
Metadata
- Authors
- Wang, X., Chan, H., & Shi, E.
- Venue
- Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2015-10-12
- Pages
- 850-861
- OpenAlex
- W2051576234
- Cited by
- 225
- References
- 1
- FWCI
- 15.72
- 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: Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. https://app.cochat.ai/papers/10.1145/2810103.2813634
- The paper
- Wang, X., Chan, H., & Shi, E. (2015). Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound. Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/2810103.2813634
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.