Optimizing ORAM and Using It Efficiently for Secure Computation
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 4×
“Lastly, we show that it is possible to optimize the asymptotic communication complexity and the client’s computation time using homomorphic encryption (HE) [6].”
BackgroundMethodInfluentialSelf-citationGoldreich, 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
Path ORAM: an extremely simple oblivious RAM protocol
Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., & Devadas, S. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516660 · Cited by 698
Thapa, C., & Camtepe, S. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2020.104130 · Cited by 393
Metadata
- Authors
- Gentry, C., Goldman, K. A., Halevi, S., Julta, C., Raykova, M., & Wichs, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 1-18
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2096379058
- Cited by
- 168
- References
- 2
- FWCI
- 17.78
- 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: Optimizing ORAM and Using It Efficiently for Secure Computation. https://app.cochat.ai/papers/10.1007/978-3-642-39077-7_1
- The paper
- Gentry, C., Goldman, K. A., Halevi, S., Julta, C., Raykova, M., & Wichs, D. (2013). Optimizing ORAM and Using It Efficiently for Secure Computation. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-39077-7_1
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.