VLDB 2026 Research / reviewers in the wild / expert
Danny McPherson
dblp:62/5775
· DBLP profile ↗
6ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3Security and privacy · 2Systems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
2 papers |
Network security · 61% Usable security · 30% Cryptographic protocols and secure computation · 9% | |
| Computer networks
3 papers |
Internet architecture and protocols · 53% Network measurement and analytics · 26% Network management and operations · 14% |
Topics — the 5 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network security › protocol security
DNS security |
0.2 | 1 | 2014 | Verifying Keys through Publicity and Communities of Trust: Quantifying Off-Axis Corroboration · IEEE Trans. Parallel Distributed Syst. 2014 |
Usable security › authentication usability
key verification |
0.2 | 1 | 2014 | Verifying Keys through Publicity and Communities of Trust: Quantifying Off-Axis Corroboration · IEEE Trans. Parallel Distributed Syst. 2014 |
Internet architecture and protocols › domain name system
DNSSEC |
0.1 | 1 | 2014 | Verifying Keys through Publicity and Communities of Trust: Quantifying Off-Axis Corroboration · IEEE Trans. Parallel Distributed Syst. 2014 |
Internet architecture and protocols
domain name system |
0.1 | 1 | 2014 | Verifying Keys through Publicity and Communities of Trust: Quantifying Off-Axis Corroboration · IEEE Trans. Parallel Distributed Syst. 2014 |
Cryptographic protocols and secure computation › key management
public key infrastructure |
0.1 | 1 | 2014 | Verifying Keys through Publicity and Communities of Trust: Quantifying Off-Axis Corroboration · IEEE Trans. Parallel Distributed Syst. 2014 |
Methods — techniques the papers use, named apart from their topics
visualization · 0.4theoretical modeling · 0.4quantitative measurement · 0.4dependency analysis · 0.4traffic instrumentation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | The Shape and Size of Threats: Defining a Networked System's Attack SurfaceabstractAs more complex security services have been added to today's Internet, it becomes increasingly difficult to quantify their vulnerability to compromise. The concept of "attack surface" has emerged in recent years as a measure of such vulnerabilities, however systematically quantifying the attack surfaces of networked systems remains an open challenge. In this work we propose a methodology to both quantify the attack surface and visually represent semantically different components (or resources) of such systems by identifying their dependencies. To illustrate the efficacy of our methodology, we examine two real Internet standards (the X.509 CA verification system and DANE) as case studies. We believe this work represents a first step towards systemically modeling dependencies of (and interdependencies between) networked systems, and shows the usability benefits from leveraging existing services. Eric Osterweil, Danny McPherson, Lixia Zhang 0001 |
ICNP | 2 |
| 2014 | Verifying Keys through Publicity and Communities of Trust: Quantifying Off-Axis CorroborationabstractThe DNS Security Extensions (DNSSEC) arguably make DNS the first core Internet system to be protected using public key cryptography. The success of DNSSEC not only protects the DNS, but has generated interest in using this secured global database for new services such as those proposed by the IETF DANE working group. However, continued success is only possible if several important operational issues can be addressed. For example, .gov and .arpa have already suffered misconfigurations where DNS continued to function properly, but DNSSEC failed (thus, orphaning their entire subtrees in DNSSEC). Internet-scale verification systems must tolerate this type of chaos, but what kind of verification can one derive for systems with dynamism like this? In this paper, we propose to achieve robust verification with a new theoretical model, called Public Data, which treats operational deployments as Communities of Trust (CoTs) and makes them the verification substrate. Using a realization of the above idea, called Vantages, we quantitatively show that using a reasonable DNSSEC deployment model and a typical choice of a CoT, an adversary would need to be able to have visibility into and perform on-path Man-in-the-Middle (MitM) attacks on arbitrary traffic into and out of up to 90 percent of the all of the Autonomous Systems (ASes) in the Internet before having even a 10 percent chance of spoofing a DNSKEY. Further, our limited deployment of Vantages has outperformed the verifiability of DNSSEC and has properly validated its data up to 99.5 percent of the time. Eric Osterweil, Daniel Massey, Danny McPherson, Lixia Zhang 0001 |
IEEE Trans. Parallel Distributed Syst. | 3 |
| 2012 | Behavior of DNS' Top Talkers, a .com/.net View
Eric Osterweil, Danny McPherson, Steve DiBenedetto, Christos Papadopoulos, Daniel Massey |
PAM | 2 |
| 2011 | The great IPv4 land grab: resource certification for the IPv4 grey marketabstractThe era of free IPv4 address allocations has ended and the grey market in IPv4 addresses is now emerging. This paper argues that one cannot and should not try to regulate who sells addresses and at what price, but one does need to provide some proof of ownership in the form of resource certification. In this paper we identify key requirements of resource certification, gained from both theoretical analysis and operational history. We further argue these requirements can be achieved by making use of the existing reverse DNS hierarchy, enhanced with DNS Security. Our analysis compares reverse DNS entries and BGP routing tables and shows this is both feasible and achievable today; an essential requirement as the grey market is also emerging today and solutions are needed now, not years in the future. Eric Osterweil, Shane Amante, Daniel Massey, Danny McPherson |
HotNets | 4 |
| 2010 | Investigating Occurrence of Duplicate Updates in BGP Announcements
Jong Han Park, Dan Jen, Mohit Lad, Shane Amante, Danny McPherson, Lixia Zhang 0001 |
PAM | 5 |
| 2010 | Internet inter-domain trafficabstractIn this paper, we examine changes in Internet inter-domain traffic demands and interconnection policies. We analyze more than 200 Exabytes of commercial Internet traffic over a two year period through the instrumentation of 110 large and geographically diverse cable operators, international transit backbones, regional networks and content providers. Our analysis shows significant changes in inter-AS traffic patterns and an evolution of provider peering strategies. Specifically, we find the majority of inter-domain traffic by volume now flows directly between large content providers, data center / CDNs and consumer networks. We also show significant changes in Internet application usage, including a global decline of P2P and a significant rise in video traffic. We conclude with estimates of the current size of the Internet by inter-domain traffic volume and rate of annualized inter-domain traffic growth. Craig Labovitz, Scott Iekel-Johnson, Danny McPherson, Jon Oberheide, Farnam Jahanian |
SIGCOMM | 3 |