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.
Decentralized trust management
2002566 citationsMatt Blaze, Joan Feigenbaum et al.profile →
This map shows the geographic impact of Matt Blaze'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 Matt Blaze with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matt Blaze more than expected).
This network shows the impact of papers produced by Matt Blaze. 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 Matt Blaze. The network helps show where Matt Blaze may publish in the future.
Co-authorship network of co-authors of Matt Blaze
This figure shows the co-authorship network connecting the top 25 collaborators of Matt Blaze.
A scholar is included among the top collaborators of Matt Blaze 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 Matt Blaze. Matt Blaze is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bellovin, Steven M., et al.. (2016). It's Too Complicated: The Technological Implications of IP-Based Communications on Content/Non-Content Distinctions and the Third Party Doctrine. SSRN Electronic Journal.1 indexed citations
3.
Bellovin, Steven M., et al.. (2016). It's Too Complicated: How the Internet Upends Katz, Smith, and Electronic Surveillance Law. 30(1). 1.7 indexed citations
4.
Bellovin, Steven M., et al.. (2014). Lawful Hacking: Using Existing Vulnerabilities for Wiretapping on the Internet. 12(1). 1.9 indexed citations
Blaze, Matt, et al.. (2011). Why (special agent) Johnny (still) can't encrypt: a security analysis of the APCO project 25 two-way radio system. USENIX Security Symposium. 4–4.34 indexed citations
7.
Aviv, Adam J., Micah Sherr, Matt Blaze, & Jonathan M. Smith. (2010). Evading cellular data monitoring with human movement networks. 1–9.6 indexed citations
Sherr, Micah, Boon Thau Loo, & Matt Blaze. (2008). Veracity: a fully decentralized service for securing network coordinate systems. 15–15.14 indexed citations
10.
Aviv, Adam J., et al.. (2008). Security evaluation of ES&S voting machines and election management system. 11.24 indexed citations
11.
Sherr, Micah, Boon Thau Loo, & Matt Blaze. (2007). Towards application-aware anonymous routing. 4.14 indexed citations
12.
Blaze, Matt, et al.. (2006). Keyboards and covert channels. USENIX Security Symposium. 122(4). 5–74.152 indexed citations
13.
Anand, Madhukar, Eric Cronin, Micah Sherr, et al.. (2006). Sensor network security: more interesting than you think. ScholarlyCommons (University of Pennsylvania). 5–5.16 indexed citations
Blaze, Matt, Joan Feigenbaum, & Jack Lacy. (2002). Decentralized trust management. 164–173.566 indexed citations breakdown →
16.
Blaze, Matt. (2000). Looking on the Bright Side of Black-Box Cryptography (Transcript of Discussion). 54–61.3 indexed citations
17.
Blaze, Matt. (1995). Protocol failure in the Escrowed Encryption Standard. Springer eBooks. 131–146.
18.
Blaze, Matt. (1994). Key management in an encrypting file system. 3–3.29 indexed citations
19.
Ioannidis, John P. A. & Matt Blaze. (1993). The Architecture and Implementation of Network Layer Security in UNIX.. USENIX Security Symposium.14 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.