The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Efficient signature generation by smart cards
Open accessOverview
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
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
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_22 · Cited by 1,381
Self-citationThe 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
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
Self-citation
Cited by
Items 101–107 of 107
Misra, S., Tourani, R., Natividad, F., Mick, T., Majd, N. E., & Huang, H. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2017.2672991 · Cited by 80
ValueShuffle: Mixing Confidential Transactions for Comprehensive Transaction Privacy in Bitcoin
Ruffing, T., & Moreno-Sanchez, P. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70278-0_8 · Cited by 73
Formal Treatment of Privacy-Enhancing Credential Systems
Camenisch, J., Krenn, S., Lehmann, A., Mikkelsen, G. L., Neven, G., & Pedersen, M. Ø. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-31301-6_1 · Cited by 65
Energy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61
Efficient, Compromise Resilient and Append-Only Cryptographic Schemes for Secure Audit Logging
Yavuz, A. A., Ning, P., & Reiter, M. K. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_12 · Cited by 53
UCoin: An Efficient Privacy Preserving Scheme for Cryptocurrencies
Nosouhi, M. R., Yu, S., Sood, K., Grobler, M., Jurdak, R., Dorri, A., & Shen, S. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3130952 · Cited by 32
On Cryptographic Mechanisms for the Selective Disclosure of Verifiable Credentials
Flamini, A., Sciarretta, G., Scuro, M., Sharif, A., Tomasi, A., & Ranise, S. (2024) · arXiv · Cited by 24
“An example of secure sigma protocol, which is the building block of the NIZKPs mentioned in Section 5, is the sigma protocol for linear relations [BS23], a generalisation of the well known Schnorr sigma protocol [Sch91].”
Method
Metadata
- Authors
- Schnorr, C. P.
- Venue
- Journal of Cryptology
- Published
- 1991-01
- Volume
- 4
- Issue
- 3
- Pages
- 161-174
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2095708839
- Cited by
- 2,787
- References
- 23
- FWCI
- 6.28
- Type
- journal article
- Language
- en
- Open access
- green
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.