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.
Peek-a-Boo, I Still See You: Why Efficient Traffic Analysis Countermeasures Fail
2012289 citationsKevin P. Dyer, Scott E. Coull et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Thomas Shrimpton
Since
Specialization
Citations
This map shows the geographic impact of Thomas Shrimpton'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 Thomas Shrimpton with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Shrimpton more than expected).
Fields of papers citing papers by Thomas Shrimpton
This network shows the impact of papers produced by Thomas Shrimpton. 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 Thomas Shrimpton. The network helps show where Thomas Shrimpton may publish in the future.
Co-authorship network of co-authors of Thomas Shrimpton
This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Shrimpton.
A scholar is included among the top collaborators of Thomas Shrimpton 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 Thomas Shrimpton. Thomas Shrimpton is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Dyer, Kevin P., Scott E. Coull, & Thomas Shrimpton. (2015). Marionette: a programmable network-traffic obfuscation system. USENIX Security Symposium. 367–382.22 indexed citations
Luchaup, Daniel, Kevin P. Dyer, Somesh Jha, Thomas Ristenpart, & Thomas Shrimpton. (2014). LibFTE: a toolkit for constructing practical, format-abiding encryption schemes. USENIX Security Symposium. 877–891.12 indexed citations
Dyer, Kevin P., Scott E. Coull, Thomas Ristenpart, & Thomas Shrimpton. (2012). Peek-a-Boo, I Still See You: Why Efficient Traffic Analysis Countermeasures Fail. 332–346.289 indexed citations breakdown →
Shrimpton, Thomas & Martijn Stam. (2008). Building a Collision-Resistant Compression Function from Non-compressing Primitives (Extended Abstract).1 indexed citations
Shrimpton, Thomas, et al.. (1977). CONTAINER TERMINALS-THE RELATIONSHIP BETWEEN DWELL TIME AND THROUGHPUT.1 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.