The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Packed Ciphertexts in LWE-Based Homomorphic Encryption
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
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
Cited by
Verifynet: Secure and verifiable federated learning
Xu, G., Li, H., Liu, S., Yang, K., & Lin, X. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2929409 · Cited by 839
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
Ducas, L., & Micciancio, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_24 · Cited by 745
Halevi, S., & Shoup, V. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44371-2_31 · Cited by 559
Self-citationBatch Fully Homomorphic Encryption over the Integers
Cheon, J. H., Coron, J.-S., Kim, J., Lee, M. S., Lepoint, T., Tibouchi, M., & Yun, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_20 · Cited by 352
Fast Private Set Intersection from Homomorphic Encryption
Chen, H., Laine, K., & Rindal, P. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134061 · Cited by 352
Metadata
- Authors
- Brakerski, Z., Gentry, C., & Halevi, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 1-13
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1874619058
- Cited by
- 207
- References
- 1
- FWCI
- 11.49
- 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: Packed Ciphertexts in LWE-Based Homomorphic Encryption. https://app.cochat.ai/papers/10.1007/978-3-642-36362-7_1
- The paper
- Brakerski, Z., Gentry, C., & Halevi, S. (2013). Packed Ciphertexts in LWE-Based Homomorphic Encryption. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-36362-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.