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 Scott E. Coull
Since
Specialization
Citations
This map shows the geographic impact of Scott E. Coull'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 Scott E. Coull with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Scott E. Coull more than expected).
This network shows the impact of papers produced by Scott E. Coull. 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 Scott E. Coull. The network helps show where Scott E. Coull may publish in the future.
Co-authorship network of co-authors of Scott E. Coull
This figure shows the co-authorship network connecting the top 25 collaborators of Scott E. Coull.
A scholar is included among the top collaborators of Scott E. Coull 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 Scott E. Coull. Scott E. Coull is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Demetrio, Luca, Scott E. Coull, Battista Biggio, et al.. (2021). Adversarial EXEmples. ACM Transactions on Privacy and Security. 24(4). 1–31.71 indexed citations
3.
Dyer, Kevin P., Scott E. Coull, & Thomas Shrimpton. (2015). Marionette: a programmable network-traffic obfuscation system. USENIX Security Symposium. 367–382.22 indexed citations
Coull, Scott E., et al.. (2012). Toward efficient querying of compressed network payloads. USENIX Annual Technical Conference. 10–10.7 indexed citations
6.
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 →
7.
Coull, Scott E., Andrew M. White, Ting-Fang Yen, Fabian Monrose, & Michael K. Reiter. (2012). Understanding domain registration abuses. Computers & Security. 31(7). 806–815.9 indexed citations
Coull, Scott E., Fabian Monrose, & Michael Bailey. (2011). On Measuring the Similarity of Network Hosts: Pitfalls, New Metrics, and Empirical Analyses.. Network and Distributed System Security Symposium.14 indexed citations
Coull, Scott E. & Bolesław K. Szymański. (2008). Sequence alignment for masquerade detection. Computational Statistics & Data Analysis. 52(8). 4116–4131.47 indexed citations
Coull, Scott E., Michael P. Collins, Charles V. Wright, Fabian Monrose, & Michael K. Reiter. (2007). On web browsing privacy in anonymized NetFlows. 23.36 indexed citations
19.
Coull, Scott E., Charles V. Wright, Fabian Monrose, Michael P. Collins, & Michael K. Reiter. (2007). Playing Devil's Advocate: Inferring Sensitive Information from Anonymized Network Traces..70 indexed citations
20.
Coull, Scott E., et al.. (2006). Tracking Anonymous Peer-to- Peer VoIP Calls on the Internet.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.