Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David Adrian

dblp:150/5960 · DBLP profile ↗
← Back
12ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 2 since 2021Security and privacy · 6 · 1 first-author

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
9 papers
Network security · 38% Cryptographic protocols and secure computation · 23% Systems and software security · 23%
Computer networks
6 papers
Network measurement and analytics · 93% Internet architecture and protocols · 7%

Topics — the 20 heaviest of 23, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics › active measurement
internet-wide scanning
1.432024
Ten Years of ZMap · IMC 2024
On the Origin of Scanning: The Impact of Location on Internet-Wide Scans · Internet Measurement Conference 2020
A Search Engine Backed by Internet-Wide Scanning · CCS 2015
Network measurement and analytics › internet measurement
DNS measurement
0.612022
ZDNS: a fast DNS toolkit for internet measurement · IMC 2022
Systems and software security
vulnerability discovery
0.532020
A Search Engine Backed by Internet-Wide Scanning · CCS 2015
The Matter of Heartbleed · Internet Measurement Conference 2014
On the Origin of Scanning: The Impact of Location on Internet-Wide Scans · Internet Measurement Conference 2020
Network security › secure communication › secure communication protocol
TLS
0.532016
DROWN: Breaking TLS Using SSLv2 · USENIX Security Symposium 2016
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice · CCS 2015
The Matter of Heartbleed · Internet Measurement Conference 2014
Cryptographic protocols and secure computation
key exchange
0.422017
Measuring small subgroup attacks against Diffie-Hellman · NDSS 2017
DROWN: Breaking TLS Using SSLv2 · USENIX Security Symposium 2016
Network security › network scanning
internet-wide scanning
0.422024
Ten Years of ZMap · IMC 2024
On the Origin of Scanning: The Impact of Location on Internet-Wide Scans · Internet Measurement Conference 2020
Cryptographic protocols and secure computation › key management
public key infrastructure
0.312018
Tracking Certificate Misissuance in the Wild · IEEE Symposium on Security and Privacy 2018
Cryptographic protocols and secure computation › key exchange
diffie-hellman key exchange
0.312017
Measuring small subgroup attacks against Diffie-Hellman · NDSS 2017
Systems and software security › vulnerability analysis
attack surface measurement
0.212024
Ten Years of ZMap · IMC 2024
Cryptographic primitives and cryptanalysis
discrete logarithm
0.212015
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice · CCS 2015
Authentication and access control › authentication
email authentication
0.212015
Neither Snow Nor Rain Nor MITM...: An Empirical Analysis of Email Delivery Security · Internet Measurement Conference 2015
Network security
email security
0.212015
Neither Snow Nor Rain Nor MITM...: An Empirical Analysis of Email Delivery Security · Internet Measurement Conference 2015
Cryptographic primitives and cryptanalysis › integer factorization
number field sieve
0.212015
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice · CCS 2015
Network security
protocol state fuzzing
0.212015
Neither Snow Nor Rain Nor MITM...: An Empirical Analysis of Email Delivery Security · Internet Measurement Conference 2015
Network security
traffic analysis
0.212015
Neither Snow Nor Rain Nor MITM...: An Empirical Analysis of Email Delivery Security · Internet Measurement Conference 2015
Systems and software security
vulnerability management
0.212014
The Matter of Heartbleed · Internet Measurement Conference 2014
Internet architecture and protocols
domain name system
0.212022
ZDNS: a fast DNS toolkit for internet measurement · IMC 2022
Information retrieval
search engines
0.112015
A Search Engine Backed by Internet-Wide Scanning · CCS 2015
Network measurement and analytics › internet measurement
internet-wide measurement
0.112015
Neither Snow Nor Rain Nor MITM...: An Empirical Analysis of Email Delivery Security · Internet Measurement Conference 2015
Network security › secure communication › secure communication protocol
HTTPS
0.112014
The Matter of Heartbleed · Internet Measurement Conference 2014

Methods — techniques the papers use, named apart from their topics

internet-wide scanning · 1.5certificate linting · 0.7statistical reporting · 0.7full-text search · 0.7active measurement · 0.6measurement study · 0.3protocol analysis · 0.2cryptanalysis · 0.2number field sieve discrete log · 0.2man-in-the-middle attack · 0.2
YearPublicationVenuePosition
2024 Ten Years of ZMap
abstract
Since ZMap's debut in 2013, networking and security researchers have used the open-source scanner to write hundreds of research papers that study Internet behavior. In addition, ZMap has been adopted by the security industry to build new classes of enterprise security and compliance products. Over the past decade, much of ZMap's behavior---ranging from its pseudorandom IP generation to its packet construction---has evolved as we have learned more about how to scan the Internet. In this work, we quantify ZMap's adoption over the ten years since its release, describe its modern behavior (and the measurements that motivated changes), and offer lessons from releasing and maintaining ZMap for future tools.
Zakir Durumeric, David Adrian, Phillip Stephens, Eric Wustrow, J. Alex Halderman
IMC2
2022 ZDNS: a fast DNS toolkit for internet measurement
abstract
Active DNS measurement is fundamental to understanding and improving the DNS ecosystem. However, the absence of an extensible, high-performance, and easy-to-use DNS toolkit has limited both the reproducibility and coverage of DNS research. In this paper, we introduce ZDNS, a modular and open-source active DNS measurement framework optimized for large-scale research studies of DNS on the public Internet. We describe ZDNS's architecture, evaluate its performance, and present two case studies that highlight how the tool can be used to shed light on the operational complexities of DNS. We hope that ZDNS will enable researchers to better---and in a more reproducible manner---understand Internet behavior.
Liz Izhikevich, Gautam Akiwate, Briana Berger, Spencer Drakontaidis, Anna Ascheman, Paul Pearce, David Adrian, Zakir Durumeric
IMC7
2020 On the Origin of Scanning: The Impact of Location on Internet-Wide Scans
abstract
Fast IPv4 scanning has enabled researchers to answer a wealth of security and networking questions. Yet, despite widespread use, there has been little validation of the methodology's accuracy, including whether a single scan provides sufficient coverage. In this paper, we analyze how scan origin affects the results of Internet-wide scans by completing three HTTP, HTTPS, and SSH scans from seven geographically and topologically diverse networks. We find that individual origins miss an average 1.6-8.4% of HTTP, 1.5-4.6% of HTTPS, and 8.3-18.2% of SSH hosts. We analyze why origins see different hosts, and show how permanent and temporary blocking, packet loss, geographic biases, and transient outages affect scan results. We discuss the implications for scanning and provide recommendations for future studies.
Gerry Wan, Liz Izhikevich, David Adrian, Katsunari Yoshioka, Ralph Holz, Christian Rossow, Zakir Durumeric
Internet Measurement Conference3
2018 Tracking Certificate Misissuance in the Wild
abstract
Certificate Authorities (CAs) regularly make mechanical errors when issuing certificates. To quantify these errors, we introduce ZLint, a certificate linter that codifies the policies set forth by the CA/Browser Forum Baseline Requirements and RFC 5280 that can be tested in isolation. We run ZLint on browser-trusted certificates in Censys and systematically analyze how well CAs construct certificates. We find that the number errors has drastically reduced since 2012. In 2017, only 0.02% of certificates have errors. However, this is largely due to a handful of large authorities that consistently issue correct certificates. There remains a long tail of small authorities that regularly issue non-conformant certificates. We further find that issuing certificates with errors is correlated with other types of mismanagement and for large authorities, browser action. Drawing on our analysis, we conclude with a discussion on how the community can best use lint data to identify authorities with worrisome organizational practices and ensure long-term health of the Web PKI.
Deepak Kumar 0006, Zhengping Wang, Matthew Hyder, Joseph Dickinson, Gabrielle Beck, David Adrian, Joshua Mason, Zakir Durumeric, J. Alex Halderman, Michael D. Bailey
IEEE Symposium on Security and Privacy6
2017 Measuring small subgroup attacks against Diffie-Hellman
Luke Valenta, David Adrian, Antonio Sanso, Shaanan Cohney, Joshua Fried, Marcella Hastings, J. Alex Halderman, Nadia Heninger
NDSS2
2016 An Internet-wide view of ICS devices
abstract
Industrial control systems have become ubiquitous, enabling the remote, electronic control of physical equipment and sensors. Originally designed to operate on closed networks, the protocols used by these devices have no built-in security. However, despite this, an alarming number of systems are connected to the public Internet and an attacker who finds a device often can cause catastrophic damage to physical infrastructure. We consider two aspects of ICS security in this work: (1) what devices have been inadvertently exposed on the public Internet, and (2) who is searching for vulnerable systems. First, we implement five common SCADA protocols in ZMap and conduct a survey of the public IPv4 address space finding more than 60K publicly accessible systems. Second, we use a large network telescope and high-interaction honeypots to find and profile actors searching for devices. We hope that our findings can both motivate and inform future work on securing industrial control systems.
Ariana Mirian, Zane Ma, David Adrian, Matthew Tischer, Thasphon Chuenchujit, Timothy M. Yardley, Robin Berthier, Joshua Mason, Zakir Durumeric, J. Alex Halderman, Michael D. Bailey
PST3
2016 DROWN: Breaking TLS Using SSLv2
Nimrod Aviram, Sebastian Schinzel, Juraj Somorovsky, Nadia Heninger, Maik Dankel, Jens Steube, Luke Valenta, David Adrian, J. Alex Halderman, Viktor Dukhovni, Emilia Käsper, Shaanan Cohney, Susanne Engels, Christof Paar, Yuval Shavitt
USENIX Security Symposium8
2015 Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice
abstract
We investigate the security of Diffie-Hellman key exchange as used in popular Internet protocols and find it to be less secure than widely believed. First, we present Logjam, a novel flaw in TLS that lets a man-in-the-middle downgrade connections to "export-grade" Diffie-Hellman. To carry out this attack, we implement the number field sieve discrete log algorithm. After a week-long precomputation for a specified 512-bit group, we can compute arbitrary discrete logs in that group in about a minute. We find that 82% of vulnerable servers use a single 512-bit group, allowing us to compromise connections to 7% of Alexa Top Million HTTPS sites. In response, major browsers are being changed to reject short groups. We go on to consider Diffie-Hellman with 768- and 1024-bit groups. We estimate that even in the 1024-bit case, the computations are plausible given nation-state resources. A small number of fixed or standardized groups are used by millions of servers; performing precomputation for a single 1024-bit group would allow passive eavesdropping on 18% of popular HTTPS sites, and a second group would allow decryption of traffic to 66% of IPsec VPNs and 26% of SSH servers. A close reading of published NSA leaks shows that the agency's attacks on VPNs are consistent with having achieved such a break. We conclude that moving to stronger key exchange methods should be a priority for the Internet community.
David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green 0001, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thomé, Luke Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella-Béguelin, Paul Zimmermann 0001
CCS1
2015 A Search Engine Backed by Internet-Wide Scanning
abstract
Fast Internet-wide scanning has opened new avenues for security research, ranging from uncovering widespread vulnerabilities in random number generators to tracking the evolving impact of Heartbleed. However, this technique still requires significant effort: even simple questions, such as, "What models of embedded devices prefer CBC ciphers?", require developing an application scanner, manually identifying and tagging devices, negotiating with network administrators, and responding to abuse complaints. In this paper, we introduce Censys, a public search engine and data processing facility backed by data collected from ongoing Internet-wide scans. Designed to help researchers answer security-related questions, Censys supports full-text searches on protocol banners and querying a wide range of derived fields (e.g., 443.https.cipher). It can identify specific vulnerable devices and networks and generate statistical reports on broad usage patterns and trends. Censys returns these results in sub-second time, dramatically reducing the effort of understanding the hosts that comprise the Internet. We present the search engine architecture and experimentally evaluate its performance. We also explore Censys's applications and show how questions asked in recent studies become simple to answer.
Zakir Durumeric, David Adrian, Ariana Mirian, Michael D. Bailey, J. Alex Halderman
CCS2
2015 Neither Snow Nor Rain Nor MITM...: An Empirical Analysis of Email Delivery Security
abstract
The SMTP protocol is responsible for carrying some of users' most intimate communication, but like other Internet protocols, authentication and confidentiality were added only as an afterthought. In this work, we present the first report on global adoption rates of SMTP security extensions, including: STARTTLS, SPF, DKIM, and DMARC. We present data from two perspectives: SMTP server configurations for the Alexa Top Million domains, and over a year of SMTP connections to and from Gmail. We find that the top mail providers (e.g., Gmail, Yahoo, and Outlook) all proactively encrypt and authenticate messages. However, these best practices have yet to reach widespread adoption in a long tail of over 700,000 SMTP servers, of which only 35% successfully configure encryption, and 1.1% specify a DMARC authentication policy. This security patchwork---paired with SMTP policies that favor failing open to allow gradual deployment---exposes users to attackers who downgrade TLS connections in favor of cleartext and who falsify MX records to reroute messages. We present evidence of such attacks in the wild, highlighting seven countries where more than 20% of inbound Gmail messages arrive in cleartext due to network attackers.
Zakir Durumeric, David Adrian, Ariana Mirian, James Kasten, Elie Bursztein, Nicolas Lidzborski, Kurt Thomas, Vijay Eranti, Michael D. Bailey, J. Alex Halderman
Internet Measurement Conference2
2015 Performance and Energy Consumption Analysis of a Delay-Tolerant Network for Censorship-Resistant Communication
abstract
Delay Tolerant Networks (DTNs) composed of commodity mobile devices have the potential to support communication applications resistant to blocking and censorship, as well as certain types of surveillance. We analyze the performance and energy consumption of such a network, and consider the impact of random and targeted denial-of-service and censorship attacks. To gather wireless connectivity traces for a DTN composed of human-carried commodity smartphones, we implemented and deployed a prototype DTN-based micro-blogging application, called 1am, in a college town. We analyzed the system during a time period with 111 users. Although the study provided detailed enough connectivity traces to enable analysis, message posting was too infrequent to draw strong conclusions based on user-initiated messages, alone. We therefore simulated more frequent message initiations and used measured connectivity traces to analyze message propagation. Using a flooding protocol, we found that with an adoption rate of 0.2% of a college town's student and faculty population, the median one-week delivery rate is 85% and the median delivery delay is 13 hours. We also found that the network delivery rate and delay are robust to denial-of service and censorship attacks eliminating more than half of the participants. Using a measurement-based energy model, we also found that the DTN system would use less than 10.0% of a typical smartphone's battery energy per day in a network of 2,500 users.
David R. Bild, David Adrian, Gulshan Singh, Robert P. Dick, Dan S. Wallach, Z. Morley Mao
MobiHoc3
2014 The Matter of Heartbleed
abstract
The Heartbleed vulnerability took the Internet by surprise in April 2014. The vulnerability, one of the most consequential since the advent of the commercial Internet, allowed attackers to remotely read protected memory from an estimated 24--55% of popular HTTPS sites. In this work, we perform a comprehensive, measurement-based analysis of the vulnerability's impact, including (1) tracking the vulnerable population, (2) monitoring patching behavior over time, (3) assessing the impact on the HTTPS certificate ecosystem, and (4) exposing real attacks that attempted to exploit the bug. Furthermore, we conduct a large-scale vulnerability notification experiment involving 150,000 hosts and observe a nearly 50% increase in patching by notified hosts. Drawing upon these analyses, we discuss what went well and what went poorly, in an effort to understand how the technical community can respond more effectively to such events in the future.
Zakir Durumeric, James Kasten, David Adrian, J. Alex Halderman, Michael D. Bailey, Frank Li 0001, Nicholas Weaver, Johanna Amann, Jethro G. Beekman, Mathias Payer, Vern Paxson
Internet Measurement Conference3