The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
New Directions in Cryptography
Abstract
chapter Share on New Directions in Cryptography Authors: Whitfield Diffie View Profile , Martin E. Hellman View Profile Authors Info & Claims Democratizing Cryptography: The Work of Whitfield Diffie and Martin HellmanAugust 2022 Pages 365–390https://doi.org/10.1145/3549993.3550007Published:26 August 2022Publication History 0citation45DownloadsMetricsTotal Citations0Total Downloads45Last 12 Months45Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 3×
“The theoretical basis underlying this and related systems was put on a firm foundation a quarter century later by information theory [3].”
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Multiuser cryptographic techniques
Diffie, W., & Hellman, M. E. (1976) · Proceedings of the June 7-10, 1976, national computer conference and exposition on - AFIPS '76 · doi:10.1145/1499799.1499815 · Cited by 270
Self-citationA user authentication scheme not requiring secrecy in the computer
Evans, A., Kantrowitz, W., & Weiss, E. (1974) · Communications of the ACM · doi:10.1145/361082.361087 · Cited by 174
A high security log-in procedure
Purdy, G. (1974) · Communications of the ACM · doi:10.1145/361082.361089 · Cited by 142
An extension of the Shannon theory approach to cryptography
Hellman, M. E. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055709 · Cited by 117
Self-citationHumphries, J. (1969) · Electronics and Power · doi:10.1049/ep.1969.0228 · Cited by 54
Cited by
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Dierks, T., & Allen, C. (1999) · doi:10.17487/rfc2246 · Cited by 1,654
Non-interactive zero-knowledge and its applications
Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904
Ellison, C., Frantz, B., Lampson, B., Rivest, R., Thomas, B., & Ylonen, T. (1999) · doi:10.17487/rfc2693 · Cited by 762
Metadata
- Authors
- Diffie, W., & Hellman, M. E.
- Venue
- Democratizing Cryptography
- Publisher
- ACM
- Published
- 2022-08-24
- Pages
- 365-390
- OpenAlex
- W4293168393
- Cited by
- 668
- References
- 8
- FWCI
- 135.23
- Type
- book chapter
- 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.