The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Homomorphic Signatures for Polynomial Functions
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
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
A fully homomorphic encryption scheme
Boneh, D., & Gentry, C. (2009) · Cited by 2,341
Self-citationDavenport, H. (1980) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-5927-3 · Cited by 1,893
Fully Homomorphic Encryption over the Integers
van Dijk, M., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_2 · Cited by 1,858
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Schwartz, J. T. (1980) · Journal of the ACM · doi:10.1145/322217.322225 · Cited by 1,701
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
Gennaro, R., Gentry, C., & Parno, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_25 · Cited by 1,145
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
Smart, N. P., & Vercauteren, F. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_25 · Cited by 808
Cited by
Oruta: privacy-preserving public auditing for shared data in the cloud
Wang, B., Li, B., & Li, H. (2014) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2014.2299807 · Cited by 458
Random Oracles in a Quantum World
Boneh, D., Dagdelen, Ö., Fischlin, M., Lehmann, A., Schaffner, C., & Zhandry, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_3 · Cited by 449
Self-citationFunctional Signatures and Pseudorandom Functions
Boyle, E., Goldwasser, S., & Ivan, I. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54631-0_29 · Cited by 384
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Bitansky, N., Canetti, R., Chiesa, A., & Tromer, E. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488623 · Cited by 304
Metadata
- Authors
- Boneh, D., & Freeman, D. M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 149-168
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2147412664
- Cited by
- 307
- References
- 37
- FWCI
- 25.38
- 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: Homomorphic Signatures for Polynomial Functions. https://app.cochat.ai/papers/10.1007/978-3-642-20465-4_10
- The paper
- Boneh, D., & Freeman, D. M. (2011). Homomorphic Signatures for Polynomial Functions. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-20465-4_10
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.