Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Untraceable electronic mail, return addresses, and digital pseudonyms
19812.3k citationsDavid ChaumCommunications of the ACMprofile →
Security without identification: transaction systems to make big brother obsolete
1985820 citationsDavid ChaumCommunications of the ACMprofile →
The dining cryptographers problem: Unconditional sender and recipient untraceability
This map shows the geographic impact of David Chaum's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David Chaum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Chaum more than expected).
This network shows the impact of papers produced by David Chaum. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David Chaum. The network helps show where David Chaum may publish in the future.
Co-authorship network of co-authors of David Chaum
This figure shows the co-authorship network connecting the top 25 collaborators of David Chaum.
A scholar is included among the top collaborators of David Chaum based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with David Chaum. David Chaum is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Chaum, David, Peter Y. A. Ryan, & Steve Schneider. (2005). A Practical Voter-Verifiable Election Scheme.. Surrey Research Insight Open Access (The University of Surrey).25 indexed citations
4.
Bosselaers, Antoon, Jason Brandt, David Chaum, et al.. (1993). RIPE integrity primitives Part II Final report of RACE 1040. Department of Computer Science [CS]. 2–118.1 indexed citations
5.
Brands, Stefan & David Chaum. (1993). Distance-Bounding Protocols (Extended Abstract).63 indexed citations
Chaum, David, Bert den Boer, Eugène van Heyst, Stig F. Mjølsnes, & Adri Steenbeek. (1990). Efficient offline electronic checks (extended abstract). 294–301.10 indexed citations
9.
Chaum, David, et al.. (1990). SmartCash: a practical electronic payment system. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands.5 indexed citations
10.
Chaum, David, et al.. (1989). Smart card 2000 : the future of IC cards : proceedings of the IFIP WG 11.6 International Conference on Smart Card 2000--the Future of IC Cards, Laxenburg, Austria, 19-20 October 1987. Elsevier eBooks.3 indexed citations
11.
Chaum, David. (1989). The spymasters double-agent problem: Multiparty computations secure unconditionally from minorities and cryptographically from majorities. 591–602.7 indexed citations
12.
Chaum, David, et al.. (1988). Advances in cryptology--EUROCRYPT '87 : Workshop on the Theory and Application of Cryptographic Techniques, Amsterdam, The Netherlands, April 13-15, 1987 : proceedings. Springer eBooks.2 indexed citations
13.
Brassard, Gilles, David Chaum, & Claude Crépeau. (1988). Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences. 37(2). 156–189.366 indexed citations
14.
Brassard, Gilles, David Chaum, & Claude Crépeau. (1987). Minimum disclosure proofs of knowledge. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 37(2). 1–189.1 indexed citations
15.
Chaum, David. (1987). Sicherheit ohne Identifizierung: Scheckkartencomputer, die den Großen Bruder der Vergangenheit angehören lassen - Zur Diskussion gestellt. Informatik-Spektrum. 10(5). 262–277.
16.
Chaum, David. (1986). Showing credentials without identification. Signatures transferred between unconditionally unlinkable pseudonyms. 241–244.14 indexed citations
17.
Chaum, David. (1985). How to keep a secret alive: extensible partial key, key safeguarding, and threshold systems. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 481–486.
18.
Chaum, David, et al.. (1985). Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers. 192–211.18 indexed citations
Chaum, David. (1981). Electronic Mail, Return Address, and Digital Pseudonyms. Communications of the ACM. 24.4 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.