Defense Notices


All students and faculty are welcome to attend the final defense of EECS graduate students completing their M.S. or Ph.D. degrees. Defense notices for M.S./Ph.D. presentations for this year and several previous years are listed below in reverse chronological order.

Students who are nearing the completion of their M.S./Ph.D. research should schedule their final defenses through the EECS graduate office at least THREE WEEKS PRIOR to their presentation date so that there is time to complete the degree requirements check, and post the presentation announcement online.

Upcoming Defense Notices

Logan Schmalz

A Framework for Controlled Key Release

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Perry Alexander, Chair
Drew Davidson
Sankha Guria


Abstract

Modern security relies heavily on public key cryptography, and private keys and secrets in general must be protected from attackers. Against a highly-capable adversary it is ideal to store secrets outside of main memory, which is easy on general purpose systems with the now widely-available Trusted Platform Module (TPM) 2.0. However, the lack of integration between the TPM and the OS makes protecting secrets with automated availability needs difficult. We develop a strategy to authenticate OS entities and protect TPM-stored secrets without restricting access to the TPM, using standard features available on Linux---SELinux, Integrity Measurement Architecture (IMA), Extended Verification Module (EVM), and Linux Unified Key Setup (LUKS).


Sirisha Thippabhotla

From Fragments to Function: Computational Approaches for Reconstructing Biological Context in Metagenomic and Exosomal Discovery

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Cuncong Zhong, Chair
Prasad Kulkarni
Fengjun Li
Zijun Yao
Liang Xu

Abstract

Advances in high-throughput Next Generation Sequencing (NGS) technologies have transformed our ability to study biological systems. However, a fundamental gap remains between generating data and interpreting it. Sequencing produces genomes, transcriptomes, and cell-derived signals as millions of short, fragmented sequences, resulting in the loss of biological context, specifically the long-range relationships that determine genes, structured RNAs, or regulatory signals. This work investigates computational and experimental approaches to improve functional discovery by reconstructing or preserving biological context. The concept is developed across three interconnected dimensions: sensitivity, scalability, and biological fidelity, demonstrating that context is lost and must be recovered at two distinct stages of the discovery process.

The first contribution handles the loss of context that occurs after sequencing. By representing metagenomic sequencing reads as connected paths in an assembly graph and guiding graph traversal with biological models, this work recovers both protein-coding and non-coding signals that conventional fragment-level analyses fail to detect, thereby revealing functional pathways that would otherwise be missed. The second contribution makes this recovery practical at scale by introducing a significantly faster framework that preserves the sensitivity of graph-based methods while reducing computational costs by over an order of magnitude, thus enabling the analysis of large present-day datasets.

The third contribution studies the loss of context prior to sequencing. Using extracellular vesicles as a model system, the findings show that cells cultured in conventional two-dimensional environments generate signals that differ from their physiological state. In contrast, cells cultured in three-dimensional models produce signals that closely resemble those observed in patients. This shows that an accurate biological model is essential for reliable discovery, since computational methods cannot recover signals that are fundamentally distorted at their origin.

Taken together, these contributions establish a set of methods and principles for extracting meaningful biological information from fragmented, high-throughput genomic data, thereby enabling more accurate functional discovery.


Harlan Williams

State-replicated key directories: Decoupling key distribution from the messaging service to prevent person-in-the-middle attacks

When & Where:


Zoom defense, please email jgrisafe@ku.edu for defense information.

Committee Members:

Hossein Saiedian, Chair
Arvin Agah
Perry Alexander


Abstract

End-to-end encrypted (E2EE) messaging services rely on the service operator to distribute authentic public keys. This arrangement protects users from external attackers, but fails catastrophically when the service itself acts maliciously. A service that distributes a spoofed key can silently decrypt, read, and re-encrypt its users' communications—undetectably, if users simply assume the service is trustworthy.

This thesis proposes and evaluates a state-replicated key directory, a model that decouples key distribution from the messaging service entirely. Instead of a single service controlling the directory, the directory is built and maintained across multiple decentralized nodes that follow a consensus and validation protocol. This design substantially raises the cost of key substitution attacks and, under well-defined assumptions, can prevent them outright.

We make three core contributions. First, we present End2, a fully functional browser-based E2EE messaging application that integrates a state-replicated key directory without modifying the underlying cryptographic session protocol. Second, we implement and compare three distinct key directory backends—centralized, permissionless blockchain (Ethereum), and permissioned blockchain (CometBFT)—and analyze their respective security and performance trade-offs. Third, we provide an empirical evaluation under realistic workloads, including upload and query latency, long-term performance degradation, validator failure resilience, and detection of malicious key insertions.

Our results show that a permissioned, Byzantine fault-tolerant key directory achieves query performance comparable to a centralized directory while providing substantially stronger security guarantees against service-side attacks. State-replicated key directories offer a practical and deployable path toward reducing the excessive trust placed in modern E2EE messaging providers.


Past Defense Notices

Dates

DIVYA IYER

Exploring the Suitability of Existing Tools for Constructing Executable Java Slices

When & Where:


246 Nichols Hall

Committee Members:

Prasad Kulkarni, Chair
Arvin Agah
Bo Luo


Abstract


YUANYUAN ZHANG

Spectrally Efficient Multicarrier Systems for Fiber-optic Transmission

When & Where:


250 Nichols Hall

Committee Members:

Ron Hui, Chair
Chris Allen
Victor Frost
Erik Perrins
Hui Zhao

Abstract


YAO HE

Characteristics of SOA-based Tunable Ring Laser for OCT Application

When & Where:


246 Nichols Hall

Committee Members:

Ron Hui, Chair
Swapan Chakrabarti
Luke Huan


Abstract


MARTIN KUEHNHAUSEN

A Framework for Knowledge Derivation Incorporating Trust and Quality of Data

When & Where:


246 Nichols Hall

Committee Members:

Victor Frost, Chair
Luke Huan
Bo Luo
Gary Minden
Tyrone Duncan

Abstract


JOHN GIBBONS

Modeling Content Lifespan on Social Networks Using Dating Mining

When & Where:


Eaton Hall, Room 1

Committee Members:

Arvin Agah, Chair
Perry Alexander
Jerzy Grzymala-Busse
James Miller
Brian Potetz

Abstract


WESLEY PECK

Hardware/Software Co-Design via Specification Refinement

When & Where:


129 Nichols Hall

Committee Members:

Perry Alexander, Chair
Xin Fu
Andy Gill
Prasad Kulkarni
Caroline Bennett*

Abstract


WESLEY PECK

Hardware/Software Co-Design via Specification Refinement

When & Where:


129 Nichols Hall

Committee Members:

Perry Alexander, Chair
Xin Fu
Andy Gill
Prasad Kulkarni
Caroline Bennett*

Abstract


PATRICK CLARK

Novel Data Structures and Algorithms for Modeling, Analysis, and Human-Comprehension of Firewall Policies

When & Where:


2001B Eaton Hall

Committee Members:

Arvin Agah, Chair
Swapan Chakrabarti
Jerzy Grzymala-Busse
Bo Luo
Prajna Dhar*

Abstract


JUSTIN METCALF

Detection Strategies and Intercept Metrics for Intra-Pulse Radar-Embedded Communications

When & Where:


317 Nichols Hall

Committee Members:

Shannon Blunt, Chair
Erik Perrins
Glenn Prescott


Abstract


ASHWINI SHIKARIPUR NADIG

Statistical Approaches to Inferring Object Shape form Single Images

When & Where:


2001B Eaton Hall

Committee Members:

Brian Potetz, Chair
Shannon Blunt
Xue-Wen Chen
Luke Huan
Paul Selden*

Abstract