The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge
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 method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
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
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
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
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
Collision Free Hash Functions and Public Key Signature Schemes
Damgård, I. B. (2010) · Lecture Notes in Computer Science · doi:10.1007/3-540-39118-5_19 · Cited by 339
A modification of the RSA public-key encryption procedure (Corresp.)
Williams, H. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056264 · Cited by 271
How To Construct Random Functions
Goldreich, O., Goldwasser, S., & Micali, S. (1984) · 25th Annual Symposium onFoundations of Computer Science, 1984. · doi:10.1109/sfcs.1984.715949 · Cited by 163
Cited by
Signature Schemes with Bounded Leakage Resilience
Katz, J., & Vaikuntanathan, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_41 · Cited by 257
Metadata
- Authors
- Guillou, L. C., & Quisquater, J.-J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer New York
- Published
- 1990
- Pages
- 216-231
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1911825786
- Cited by
- 451
- References
- 12
- FWCI
- 3.78
- 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: A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge. https://app.cochat.ai/papers/10.1007/0-387-34799-2_16
- The paper
- Guillou, L. C., & Quisquater, J.-J. (1990). A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge. Lecture Notes in Computer Science. https://doi.org/10.1007/0-387-34799-2_16
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.
