The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Deniable Ring Authentication
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“This is very simple in most, if not all, schemes we are aware of, e.g. Shamir’s polynomial based one [ 40 ].”
BackgroundRivest, R. L., Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_32 · Cited by 1,619
Cited by
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Deng, M., Wuyts, K., Scandariato, R., Preneel, B., & Joosen, W. (2011) · Requirements Engineering · doi:10.1007/s00766-010-0115-7 · Cited by 533
ID-Based Blind Signature and Ring Signature from Pairings
Zhang, F., & Kim, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_33 · Cited by 530
On Cryptographic Assumptions and Challenges
Naor, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_6 · Cited by 360
Self-citation1-out-of-n Signatures from a Variety of Keys
Abe, M., Ohkubo, M., & Suzuki, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_26 · Cited by 337
Metadata
- Authors
- Naor, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 481-498
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1595974665
- Cited by
- 164
- References
- 2
- FWCI
- 6.25
- 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: Deniable Ring Authentication. https://app.cochat.ai/papers/10.1007/3-540-45708-9_31
- The paper
- Naor, M. (2002). Deniable Ring Authentication. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45708-9_31
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.