The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
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
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. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Authenticated Key Exchange Secure against Dictionary Attacks
Bellare, M., Pointcheval, D., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_11 · Cited by 1,503
Self-citationLower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Zero-knowledge proofs of identity
Feige, U., Fiat, A., & Shamir, A. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,029
(2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6 · Cited by 779
Universally Composable Notions of Key Exchange and Secure Channels
Canetti, R., & Krawczyk, H. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_22 · Cited by 746
A Forward-Secure Digital Signature Scheme
Bellare, M., & Miner, S. K. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_28 · Cited by 591
Self-citationProvably Secure and Practical Identification Schemes and Corresponding Signature Schemes
Okamoto, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_3 · Cited by 581
Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
Barić, N., & Pfitzmann, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_33 · Cited by 557
Witness indistinguishable and witness hiding protocols
Feige, U., & Shamir, A. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100272 · Cited by 523
Statistical zero knowledge protocols to prove modular polynomial relations
Fujisaki, E., & Okamoto, T. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052225 · Cited by 497
A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge
Guillou, L. C., & Quisquater, J.-J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_16 · Cited by 451
Secure Hash-and-Sign Signatures Without the Random Oracle
Gennaro, R., Halevi, S., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_9 · Cited by 347
On Formal Models for Secure Key Exchange.
Shoup, V. (1999) · Cited by 322
Signature schemes based on the strong RSA assumption
Cramer, R., & Shoup, V. (1999) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/319709.319716 · Cited by 193
Abdalla, M., An, J. H., Bellare, M., & Namprempre, C. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_28 · Cited by 189
Self-citationMicali, S. M., & Rivest, R. L. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45760-7_16 · Cited by 127
Fast Signature Generation with a Fiat Shamir — Like Scheme
Ong, H., & Schnorr, C. P. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_38 · Cited by 99
Identification Protocols Secure against Reset Attacks
Mihir Bellare, Y., Fischlin, M., Goldwasser, S., & Micali, S. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_30 · Cited by 96
New Public Key Cryptosystems Based on the Dependent-RSA Problems
Pointcheval, D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_17 · Cited by 61
Cited by
Multi-signatures in the plain public-Key model and a general forking lemma
Bellare, M., & Neven, G. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180453 · Cited by 654
Self-citationLattice Signatures and Bimodal Gaussians
Ducas, L., Durmus, A., Lepoint, T., & Lyubashevsky, V. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_3 · Cited by 557
Camenisch, J., Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_18 · Cited by 431
A Hybrid Cloud Approach for Secure Authorized Deduplication
Li, J., Li, Y. K., Chen, X., Lee, P. P. C., & Lou, W. (2015) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2014.2318320 · Cited by 412
Authentication and integrity in outsourced databases
Mykletun, E., Narasimha, M., & Tsudik, G. (2006) · ACM Transactions on Storage · doi:10.1145/1149976.1149977 · Cited by 382
Metadata
- Authors
- Bellare, M., & Palacio, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 162-177
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2167496998
- Cited by
- 312
- References
- 25
- FWCI
- 6.80
- 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
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.