The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
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
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947
Structured Matrices and Polynomials
Pan, V. Y. (2001) · doi:10.1007/978-1-4612-0129-8 · Cited by 203
Cited by
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
TFHE: Fast Fully Homomorphic Encryption Over the Torus
Chillotti, I., Gama, N., Georgieva, M., & Izabachène, M. (2020) · Journal of Cryptology · doi:10.1007/s00145-019-09319-x · Cited by 990
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
Self-citation
Metadata
- Authors
- Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Volume
- 2009
- Pages
- 617-635
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1491861813
- Cited by
- 369
- References
- 4
- FWCI
- 11.99
- 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: Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract). https://app.cochat.ai/papers/10.1007/978-3-642-10366-7_36
- The paper
- Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K. (2009). Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-10366-7_36
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.
