Abstract
Alice has a private input x (of any data type, such as a number, a matrix or a
data set). Bob has another private input y. Alice and Bob want to cooperatively
conduct a specific computation on x and y without disclosing to the other person any
information about her or his private input except for what could be derived from the
results. This problem is a Secure Two-party Computation (STC) problem, which has
been extensively studied in the past. Several generic solutions have been proposed to
solve the general STC problem; however the generic solutions are often too inefficient
to be practical. Therefore, in this dissertation, we study several specific STC problems
with the goal of finding more efficient solutions than the generic ones.<br><br>
We introduce a number of specific STC problems in the domains of scientific
computation, statistical analysis, computational geometry and database query. Most
of the problems have not been studied before in the literature.
