The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
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
Use of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
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
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
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
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,022
Self-citationA Course in Number Theory and Cryptography
Koblitz, N. (1987) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-0310-7 · Cited by 839
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
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
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A., Vanstone, S., & Okamoto, T. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103434 · Cited by 337
Self-citationZero Knowledge Proofs of Knowledge in Two Rounds
Feige, U., & Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_46 · Cited by 280
Fast Exponentiation with Precomputation
Brickell, E. F., Gordon, D. M., McCurley, K. S., & Wilson, D. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47555-9_18 · Cited by 236
Random self-reducibility and zero knowledge interactive proofs of possession of information
Tompa, M., & Woll, H. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.49 · Cited by 224
A digital multisignature scheme based on the Fiat-Shamir scheme
Ohta, K., & Okamoto, T. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57332-1_11 · Cited by 104
Self-citationA Modification of the Fiat-Shamir Scheme
Ohta, K., & Okamoto, T. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_17 · Cited by 100
Self-citationEfficient 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 Interactive Identification Scheme Based on Discrete Logarithms and Factoring
Brickell, E. F., & McCurley, K. S. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_6 · Cited by 94
On the composition of zero-knowledge proof systems
Goldreich, O., & Krawczyk, H. (2005) · Springer eBooks · doi:10.1007/bfb0032038 · Cited by 88
Public-Key Cryptosystems with Very Small Key Lengths
Harper, G., Menezes, A., & Vanstone, S. A. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_14 · Cited by 71
An interactive identification scheme based on discrete logarithms and factoring
Brickell, E. F., & McCurley, K. S. (1992) · Journal of Cryptology · doi:10.1007/bf00191319 · Cited by 62
On ordinary elliptic curve cryptosystems
Miyaji, A. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57332-1_39 · Cited by 13
On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols
Sakurai, K., & Itoh, T. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_17 · Cited by 9
A single public‐key authentication scheme for multiple users
Okamoto, T. (1987) · Systems and Computers in Japan · doi:10.1002/scj.4690181002 · Cited by 7
Self-citation
Cited by
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
The random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
Brands, S., & Chaum, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_30 · Cited by 804
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
Metadata
- Authors
- Okamoto, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-06
- Pages
- 31-53
- OpenAlex
- W1554259298
- Cited by
- 581
- References
- 31
- FWCI
- 26.24
- 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.