Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 3,943

The DOI matches its Crossref record.

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

Fiat, Amos, Shamir, Adi·2007·Lecture Notes in Computer Science
DOI 10.1007/3-540-47721-7_12
Open this paper in CoChat — free account

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/3-540-47721-7_12

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.

A few free checks a day · papers already verified open instantly · results are public

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

No references could be resolved yet.

Research works printed but not linked: 4

  1. Goldreich, Goldwasser and Micali [1984]: How to Construct Random Functions, 25th Symposium on Foundations of Computer Science, October 1984.
  2. Goldreich, Micali and Wigderson [1986]: Proofs that Yield Nothing But the Validity of the Assertion and the Methodology of Cryptographic Protocol Design, submitted to 27th Symposium on Foundations of Computer Science, November 1986. · DOI · Paper page
  3. Goldwasser, Micali and Rackoff [1985]: The Knowledge Complexity of Interactive Proof Systems, 17th ACM Symposium on Theory of Computation, May 1985. · DOI · Paper page
  4. Shamir [1984]: Identity-Based Cryptosystems and Signature Schemes, Proceedings of Crypto’ 84, Lecture Notes in Computer Science no. 196, Springer Verlag 1985.

Cited by

See all 3,943

Metadata

Authors
Fiat, A., & Shamir, A.
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2007-04-05
Pages
186-194
DOI
10.1007/3-540-47721-7_12
OpenAlex
W1589034595
Cited by
3,943
References
0
FWCI
112.11
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: How To Prove Yourself: Practical Solutions to Identification and Signature Problems. https://app.cochat.ai/papers/10.1007/3-540-47721-7_12
The paper
Fiat, A., & Shamir, A. (2007). How To Prove Yourself: Practical Solutions to Identification and Signature Problems. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-47721-7_12

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.