Other Applied Mathematics Commons^™

Generalizing Threshold-Based Multiparty Computation To Ramp Schemes, Christian Tucker

All Theses

Secure multiparty computation (MPC) enables multiple participants to jointly compute functions over their private inputs without revealing them. Classical threshold based protocols, such as the BGW protocol, perform computations on scalar values using (k,n)-threshold secret sharing. While these protocols provide strong security guarantees, they become computationally expensive when applied to large matrices or multiple secret values. In this work, we investigate the use of ramp schemes, secret sharing schemes that encode sets of secrets with a trade-off between privacy and efficiency, to generalize BGW computations. We show that the linear operations performed on shares (k,n)-threshold schemes in BGW can be …

Modeling Dna Repair In Escherichia Coli Using A Boolean And Stochastic Framework, Gabrianne Ivey

All Theses

DNA can be damaged through both internal and external sources. Therefore, cells have created methods to repair DNA damage. In Escherichia coli, the system responsible for DNA repair is termed the SOS response. This system consists of more than 50 genes and contains three main repair pathways: nucleotide excision repair, translesion synthesis, and homologous recombination. The response is initiated when DNA lesions result in the accumulation of single-stranded DNA (ssDNA). The protein RecA is activated by binding to ssDNA and is then denoted RecA*. RecA* assists in the auto-cleavage of LexA which is the primary repressor protein involved in …

Bounding The Convex Hull Relaxation Of The Unit Commitment Problem With The Shapley-Folkman Theorem, Lauren Henderson

All Theses

The Unit Commitment (UC) problem finds an optimal schedule for a set of generators by minimizing the total operation cost subject to demand and operational constraints. The UC problem is often modeled with a mixed-integer linear program (MILP). We employ the Shapley-Folkman Theorem to provide a bound on the size of fractional solutions of its convex hull relaxation. This result is used to obtain a bound on the optimality gap between the MILP and the convex hull relaxation, which is further tightened using several problem-specific properties of UC. We conduct extensive numerical experiments to study the tightness of this threshold, …

Multi-Commodity Flow Models For Logistic Operations Within A Contested Environment, Isabel Strinsky

All Theses

Today's military logistics officers face a difficult challenge, generating route plans for mass deployments within contested environments. The current method of generating route plans is inefficient and does not assess the vulnerability within supply networks and chains. There are few models within the current literature that provide risk-averse solutions for multi-commodity flow models. In this thesis, we discuss two models that have the potential to aid military planners in creating route plans that account for risk and uncertainty. The first model we introduce is a continuous time model with chance constraints. The second model is a two-stage discrete time model …

Null Space Removal In Finite Element Discretizations, Pengfei Jia

All Theses

Partial differential equations are frequently utilized in the mathematical formulation of physical problems. Boundary conditions need to be applied in order to obtain the unique solution to such problems. However, some types of boundary conditions do not lead to unique solutions because the continuous problem has a null space. In this thesis, we will discuss how to solve such problems effectively. We first review the foundation of all three problems and prove that Laplace problem, linear elasticity problem and Stokes problem can be well posed if we restrict the test and trial space in the continuous and discrete finite element …

Optimal First Order Methods For Reducing Gradient Norm In Unconstrained Convex Smooth Optimization, Yunheng Jiang

All Theses

In this thesis, we focus on convergence performance of first-order methods to compute an $\epsilon$-approximate solution of minimizing convex smooth function $f$ at the $N$-th iteration.

In our introduction of the above research question, we first introduce the gradient descent method with constant step size $h=1/L$. The gradient descent method has a $\mathcal{O}(L^2\|x_0-x^*\|^2/\epsilon)$ convergence with respect to $\|\nabla f(x_N)\|^2$. Next we introduce Nesterov’s accelerated gradient method, which has an $\mathcal{O}(L\|x_0-x^*\|\sqrt{1/\epsilon})$ complexity in terms of $\|\nabla f(x_N)\|^2$. The convergence performance of Nesterov’s accelerated gradient method is much better than that of the gradient descent method but still not optimal. We also …

Efficiency Of Homomorphic Encryption Schemes, Kyle Yates

All Theses

In 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical use, which are schemes that allow for some predetermined amount of additions and multiplications that can be performed on ciphertexts. These leveled schemes have been found to be very efficient in practice. In this thesis, we will discuss the efficiency of various homomorphic encryption schemes. In particular, we will see how to improve sizes of parameter choices in homomorphic …