The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Efficient Identification and Signatures for Smart Cards
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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
The knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
Zero-knowledge proofs of identity
Feige, U., Fiat, A., & Shamir, A. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,029
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,020
Zero knowledge proofs of identity
Fiege, U., Fiat, A., & Shamir, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28419 · Cited by 407
Coppersmith, D., Odlzyko, A. M., & Schroeppel, R. (1986) · Algorithmica · doi:10.1007/bf01840433 · Cited by 271
An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
Chaum, D., Evertse, J., & van de Graaf, J. (2010) · Lecture notes in computer science · doi:10.1007/3-540-39118-5_13 · Cited by 248
Efficient Zero-Knowledge Identification Scheme for Smart Cards
Beth, T. (1988) · Lecture notes in computer science · doi:10.1007/3-540-45961-8_7 · Cited by 98
An Improvement of the Fiat-Shamir Identification and Signature Scheme
Micali, S. M., & Adi Shamir, Z. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_18 · Cited by 66
Cited by
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Biscotti: A blockchain system for private and secure federated learning
Shayan, M., Fung, C., Yoon, C. J. M., & Beschastnikh, I. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3044223 · Cited by 354
Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities
Brickell, E., & Li, J. (2012) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2011.63 · Cited by 91
A scalable blockchain-based scheme for traffic-related data sharing in VANETs
Diallo, E.-H., Dib, O., & Al Agha, K. (2022) · Blockchain: Research and Applications · doi:10.1016/j.bcra.2022.100087 · Cited by 33
Metadata
- Authors
- Schnorr, C. P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer New York
- Published
- 2007-11-08
- Pages
- 239-252
- OpenAlex
- W1646354800
- Cited by
- 1,381
- References
- 10
- FWCI
- 36.00
- 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 Identification and Signatures for Smart Cards. https://app.cochat.ai/papers/10.1007/0-387-34805-0_22
- The paper
- Schnorr, C. P. (2007). Efficient Identification and Signatures for Smart Cards. Lecture Notes in Computer Science. https://doi.org/10.1007/0-387-34805-0_22
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.
