Jeffrey Todd McDonald

dblp:122/5352 · also Todd McDonald · DBLP profile ↗
← Back
12ranked-venue papers
4as first author
6since 2021 · last 2022
0000-0001-5266-7470ORCID · verified

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

Security and privacy · 6 · 3 first-author · 4 since 2021Systems, architecture and hardware · 3Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2022 Crypto-Steganographic Validity for Additive Manufacturing (3D Printing) Design Files
Mark Yampolskiy, Lynne Graves, Jacob Gatlin, Jeffrey Todd McDonald, Moti Yung
ISC4
2022 Effectiveness of Adversarial Component Recovery in Protected Netlist Circuit Designs
Jeffrey Todd McDonald, Jennifer Parnell, Todd R. Andel, Samuel H. Russ
SECRYPT1
2022 An Automated Security Concerns Recommender Based on Use Case Specification Ontology
Imano Williams, Xiaohong Yuan, Mohd Anwar, Jeffrey Todd McDonald
Autom. Softw. Eng.4
2021 Classifying Android Applications Via System Stats
abstract
Android devices continue to dominate the mobile device market. However, ever-increasing reverse engineering capabilities and the ability to repackage apps to include malicious code with relative ease introduce significant challenges for marketplace providers. This research investigates the idea that system stats generated from running apps can be utilized to identify apps. The stats are collected from the host system while apps are running in an Android Virtual Device environment. The dataset comprises 998 repackaged apps, 1,533 malicious apps, and 2,130 normal apps. The results were analyzed using a J48 decision tree and achieved 99% accuracy.
Joshua Hightower, William Glisson, Ryan G. Benton, Jeffrey Todd McDonald
IEEE BigData4
2021 Program Protection through Software-based Hardware Abstraction
abstract
International audience
Jeffrey Todd McDonald, Ramya Manikyam, Sébastien Bardin, Richard Bonichon, Todd R. Andel
SECRYPT1
2021 Machine Learning Classification of Obfuscation using Image Visualization
Colby Parker, Jeffrey Todd McDonald, Dimitrios Damopoulos
SECRYPT2
2018 Identifying stealth malware using CPU power consumption and learning algorithms
abstract
With the increased assimilation of technology into all aspects of everyday life, rootkits pose a credible threat to individuals, corporations, and governments. Using various techniques, rootkits can infect systems and remain undetected for extended periods of time. This threat necessitates the careful consideration of real-time detection solutions. Behavioral detection techniques allow for the identification of rootkits with no previously recorded signatures. This research examines a variety of machine learning algorithms, including Nearest Neighbor, Decision Trees, Neural Networks, and Support Vector Machines, and proposes a behavioral detection method based on low yield CPU power consumption. The method is evaluated on Windows 7, Windows 10, Ubuntu Desktop, and Ubuntu Server operating systems along with employing four different rootkits. Relevant features within the data are calculated and the overall best performing algorithms are identified. A nested neural network is then applied that enables highly accurate data classification. Our results present a viable method of rootkit detection that can operate in real-time with minimal computational and space complexity.
Patrick Luckett, Jeffrey Todd McDonald, William Glisson, Ryan G. Benton, Joel A. Dawson, Blair A. Doyle
J. Comput. Secur.2
2012 Evaluating component hiding techniques in circuit topologies
abstract
Security for Cyber physical systems includes not only guaranteeing operational security of data they process, but preventing malicious alteration of their execution due to knowledge of their underlying structure. With the advent of software in the form of reprogrammable hardware descriptions, protection of field programmable units from malicious reverse engineering and subversion becomes more critical. We compare four different white-box transformation algorithms aimed at hindering adversarial reverse engineering by changing component and signal configurations within combinational logic programs. We present security and efficiency analysis for these techniques and show positive results for achieving measurable hiding of signal and component information.
Jeffrey Todd McDonald, Yong C. Kim, Daniel J. Koranek, James D. Parham
ICC1
2009 Increasing stability and distinguishability of the digital fingerprint in FPGAs through input word analysis
abstract
Field programmable gate arrays (FPGAs) have become increasingly popular in circuit development due to their rapid development times and low costs. With their increased use, the need to protect their intellectual property (IP) becomes more urgent. The digital fingerprint accomplishes this by creating a unique identification (ID) for each FPGA. In this research, we propose methods to dramatically increase the stability and robustness of the digital fingerprint ID by the proper choice of input sequences. We also show that by properly choosing the input word, we can significantly increase the DF resistance to operating temperature changes.
Hiren J. Patel, Yong C. Kim, Jeffrey Todd McDonald, LaVern A. Starman
FPL3
2009 Dynamic Polymorphic Reconfiguration for anti-tamper circuits
abstract
The susceptibility of digital systems to tampering is of immense concern to military and commercial organizations. Current defenses against such techniques as reverse engineering and side channel analysis are limited and don't address the underlying vulnerable characteristics of digital circuits. In this paper, we propose a generalized defense methodology named dynamic polymorphic reconfiguration that significantly reduces the probability of successful tampering. We achieve protection through targeted component hiding and the introduction of run-time autonomous defense adaptations. As a result, we establish the feasibility of self-protecting circuits.
Roy Porter, Samuel J. Stone, Yong C. Kim, Jeffrey Todd McDonald, LaVern A. Starman
FPL4
2008 Creating digital fingerprints on commercial field programmable gate arrays
abstract
In this paper, we discuss the method of creating a circuit identifier, or digital fingerprint, for field programmable gate arrays (FPGAs). The proposed digital fingerprint is a function of the natural variations in the semiconductor manufacturing process that cannot be duplicated or forged. The proposed digital fingerprint allows the use of any arbitrary of nodes internal to the circuit or the circuit outputs as monitoring locations. Changes in the signal on a selected node or output can be quantified digitally over a period of time or at a specific instance of time. Two monitoring methods are proposed, one using cumulative observation of the nodes and the other samples the nodes based on a signal transition. Two monitoring methods were validated on a small sample of twenty XilinxregVirtex-II Pro FPGAs, where both methods successfully created unique identifiers for each FPGA. In addition, the effects of temperature and voltage fluctuations are also discussed.
James W. Crouch, Hiren J. Patel, Yong C. Kim, Jeffrey Todd McDonald, Tony C. Kim
FPT4
2007 Applications for Provably Secure Intent Protection with Bounded Input-Size Programs
abstract
The de facto standard program obfuscation security model, termed the virtual black box (VBB), declares a program to be securely obfuscated if and only if an adversary can prove no more when given the obfuscated code than it can when only given oracle access to the original program. In this paper, we define and give methodology for a perfectly secure program intent obfuscation that is general and practical for bounded input-size programs, including those with input/output relationships that are easily learned. We also lay foundations for how to embed a key securely in a private-key encryption setting using such constructions
Jeffrey Todd McDonald, Alec Yasinsac
ARES1