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.
This map shows the geographic impact of Paul Syverson'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 Paul Syverson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul Syverson more than expected).
This network shows the impact of papers produced by Paul Syverson. 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 Paul Syverson. The network helps show where Paul Syverson may publish in the future.
Co-authorship network of co-authors of Paul Syverson
This figure shows the co-authorship network connecting the top 25 collaborators of Paul Syverson.
A scholar is included among the top collaborators of Paul Syverson 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 Paul Syverson. Paul Syverson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Jaggard, Aaron D., Paul Syverson, & Catherine Meadows. (2024). A Logic of Sattestation. 142. 356–371.1 indexed citations
Jansen, Rob, et al.. (2014). Never been KIST: Tor's congestion management blossoms with Kernel-informed socket transport. USENIX Security Symposium. 127–142.24 indexed citations
5.
Jansen, Rob, Aaron Johnson, & Paul Syverson. (2013). LIRA: Lightweight Incentivized Routing for Anonymity. Network and Distributed System Security Symposium.19 indexed citations
6.
Jansen, Rob, Nicholas Hopper, & Paul Syverson. (2012). Throttling Tor Bandwidth Parasites.. University of Minnesota Digital Conservancy (University of Minnesota).1 indexed citations
Díaz, Claudia, George Danezis, Christian Grothoff, Andreas Pfitzmann, & Paul Syverson. (2005). Panel discussion - Mix cascades versus Peer-to-Peer: Is one concept superior?. UCL Discovery (University College London).2 indexed citations
13.
Vimercati, Sabrina De Capitani di, Paul Syverson, & Dieter Gollmann. (2005). Computer security - ESORICS 2005 : 10th European Symposium on Research in Computer Security, Milan, Italy, September 12-14, 2005 : proceedings. Springer eBooks.2 indexed citations
14.
Vimercati, Sabrina De Capitani di, Paul Syverson, & Dieter Gollmann. (2005). Computer Security - ESORICS 2005: 10th European Symposium on Research in Computer Security, Milan, Italy, September 12-14, 2005, Proceedings (Lecture Notes in Computer Science). Springer eBooks.2 indexed citations
15.
Syverson, Paul. (2002). Proceedings of the 5th International Conference on Financial Cryptography.6 indexed citations
16.
Serjantov, Andrei, Roger Dingledine, & Paul Syverson. (2002). From a Trickle to a Flood: Active Attacks on Several Mix Types. Defense Technical Information Center (DTIC).6 indexed citations
17.
Gorrieri, Roberto, Paul Syverson, Martı́n Abadi, et al.. (1998). Panel Introduction: Varieties of Authentication. Oxford University Research Archive (ORA) (University of Oxford). 79–82.1 indexed citations
Gray, James W. & Paul Syverson. (1992). A Multilevel Transaction Problem for Multilevel Secure Database Systems and Its Solution for the Replicated Architecture. 192.8 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.