The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
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
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
Worst-case to average-case reductions for module lattices
Langlois, A., & Stehlé, D. (2015) · Designs, Codes and Cryptography · doi:10.1007/s10623-014-9938-4 · Cited by 643
A Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Homomorphic Signatures for Polynomial Functions
Boneh, D., & Freeman, D. M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_10 · Cited by 307
Self-citationHardness of SIS and LWE with Small Parameters
Micciancio, D., & Peikert, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_2 · Cited by 299
A Decade of Lattice Cryptography
Peikert, C. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831139 · Cited by 256
Metadata
- Authors
- Boneh, D., & Freeman, D. M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 1-16
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2101444129
- Cited by
- 234
- References
- 1
- FWCI
- 17.08
- 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: Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures. https://app.cochat.ai/papers/10.1007/978-3-642-19379-8_1
- The paper
- Boneh, D., & Freeman, D. M. (2011). Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-19379-8_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.