The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Digital Signature Based on a Conventional Encryption Function
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_12 · Cited by 3,972
Secrecy, authentication, and public key systems
Merkle, R. C. (1979) · Cited by 501
Self-citationCryptography: A new dimension in computer data security
Bookstein, A. (1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90072-x · Cited by 213
A "Paradoxical" Solution To The Signature Problem
Goldwasser, S., Micali, S. M., & Rivest, R. L. (1984) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715946 · Cited by 89
A “Paradoxical” Solution to The Signature Problem
Goldwasser, S., Micali, S. M., & Rivest, R. L. (2007) · Springer eBooks · doi:10.1007/3-540-39568-7_37 · Cited by 73
Meyer, C. H., & Matyas, S. M. (1982) · International Linear Collider · Cited by 63
Goldwasser, S., Micali, S. M., & Rivest, R. L. (1987) · Elsevier eBooks · doi:10.1016/b978-0-12-386870-1.50022-8 · Cited by 10
Flagged first, then by citations
Research works printed but not linked: 1
- ‘Cryptography and Data Security’, by Dorothy E.R. Denning, Addison Wesley 1982.
Cited by
Sorted by citations
Items 1,001–1,003 of 1,003
On the (im)possibility of perennial message recognition protocols without public-key cryptography
González Muñiz, M., & Laud, P. (2011) · Proceedings of the 2011 ACM Symposium on Applied Computing · doi:10.1145/1982185.1982508 · Cited by 5
Outlining Traceability: A Principle for Operationalizing Accountability in Computing Systems
Kroll, J. A. (2021) · Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency · doi:10.1145/3442188.3445937 · Cited by 2
Yagiz, M. A., Horasan, F., & Yurttakal, A. H. (2026) · arXiv · doi:10.48550/arxiv.2605.00065
“A fourth approach, rooted in authenticated data structures, constructs Merkle trees (Merkle, 1988) over log entries and stores only the root hash in a trusted anchor.”
Influential
Metadata
- Authors
- Merkle, R. C.
- Corresponding author
- Merkle, Ralph C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1988
- Pages
- 369-378
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1600255172
- Cited by
- 1,998
- References
- 10
- Citations by year
- 2026: 133 · 2025: 128 · 2024: 158 · 2023: 149 · 2022: 132 · 2021: 153 · 2020: 158 · 2019: 165 · 2018: 121 · 2017: 71 · 2016: 68 · 2015: 54 · 2014: 50 · 2013: 51 · 2012: 44
- FWCI
- 2.62
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- digital signatures, DES, signature size, message signing
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
