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 Dewey

dblp:79/10035 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none

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

Security and privacy · 3 · 3 first-authorArtificial intelligence and machine learning · 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
Systems and software security · 100%
Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 54% Operating systems · 46%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security
binary analysis
0.112012
Static detection of C++ vtable escape vulnerabilities in binary code · NDSS 2012
Systems and software security
vulnerability discovery
0.112012
Static detection of C++ vtable escape vulnerabilities in binary code · NDSS 2012
Systems and software security
exploitation
0.112011
No Loitering: Exploiting Lingering Vulnerabilities in Default COM Objects · NDSS 2011
Programming languages and type systems › object-oriented programming
c++ object model
0.012012
Static detection of C++ vtable escape vulnerabilities in binary code · NDSS 2012
Operating systems › operating system family
windows
0.012011
No Loitering: Exploiting Lingering Vulnerabilities in Default COM Objects · NDSS 2011

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

static analysis · 0.3
YearPublicationVenuePosition
2016 Uncovering the Landscape of Fraud and Spam in the Telephony Channel
abstract
Robocalling, voice phishing, and caller ID spoofing are common cybercrime techniques used to launch scam campaigns through the telephony channel, which unsuspecting users have long trusted. More reliable than online complaints, a telephony honeypot provides complete, accurate and timely information about unwanted phone calls across the United States. Our first goal is to provide a large-scale data-driven analysis of the telephony spam and fraud ecosystem. Our second goal is to uniquely identify bad actors potentially operating several phone numbers. We collected about 40,000 unsolicited calls. Our results show that only a few bad actors, robocallers or telemarketers, are responsible for the majority of the spam and scam calls, and that they can be uniquely identified based on audio features from their calls. This discovery has major implications for law enforcement and businesses that are presently engaged in combatting the rise of telephony fraud. In particular, since our system allows endusers to detect fraudulent behavior and tie it back to existing fraud and spam campaigns, it can be used as the first step towards designing and deploying intelligent defense strategies.
Aude Marzuoli, Hassan A. Kingravi, David Dewey, Robert S. Pienta
ICMLA3
2015 Uncovering Use-After-Free Conditions in Compiled Code
abstract
Use-after-free conditions occur when an execution path of a process accesses an incorrectly deal located object. Such access is problematic because it may potentially allow for the execution of arbitrary code by an adversary. However, while increasingly common, such flaws are rarely detected by compilers in even the most obvious instances. In this paper, we design and implement a static analysis method for the detection of use-after-free conditions in binary code. Our new analysis is similar to available expression analysis and traverses all code paths to ensure that every object is defined before each use. Failure to achieve this property indicates that an object is improperly freed and potentially vulnerable to compromise. After discussing the details of our algorithm, we implement a tool and run it against a set of enterprise-grade, publicly available binaries. We show that our tool can not only catch textbook and recently released in-situ examples of this flaw, but that it has also identified 127 additional use-after-free conditions in a search of 652 compiled binaries in the Windows system32 directory. In so doing, we demonstrate not only the power of this approach in combating this increasingly common vulnerability, but also the ability to identify such problems in software for which the source code is not necessarily publicly available.
David Dewey, Bradley Reaves, Patrick Traynor
ARES1
2012 Static detection of C++ vtable escape vulnerabilities in binary code
David Dewey, Jonathon T. Giffin
NDSS1
2011 No Loitering: Exploiting Lingering Vulnerabilities in Default COM Objects
David Dewey, Patrick Traynor
NDSS1