3PC honest-majority PRAM computation with perfect security and low overhead
Zexiang Chen
Abstract
In this thesis, we present new techniques for three-party secure computation in the parallel random access machine (PRAM) model.Our protocol is perfectly secure and concretely efficient.Considering a PRAM machine storing n w-bit words and having a large number (p = O(n)) of processors, and assuming at most one passively corrupt party, our construction exhibits the following properties: