Practical and Deployable Secure Multi-Party Computation

In this article, we consider a secure multi-party computation problem (MPC), where the goal is to offload of an arbitrary polynomial function some massive private matrices (inputs) cluster workers. The workers are not reliable. Some them may collude gain information about input data (semi-honest workers). system initialized by sharing (randomized) each matrix server. Since massive, share's size...

For many applications of secure multiparty computation it is natural to demand that the output of the protocol is verifiable. Verifiability should ensure that incorrect outputs are always rejected, even if all parties executing the secure computation collude. Since the inputs to a secure computation are private, and potentially the outputs are private as well, adding verifiability is in general...