Enav Weinreb (DIAMANT/Spinoza Postdoc at CWI): Secure Computation Of Linear Algebraic Functions

In a secure multi-party protocol, a set of players wish to compute a joint function of their private inputs, without revealing any non-necessary information to their counterparts. In this this talk we introduce secure protocols for a set of linear algebraic functions such as deciding whether a matrix distributed among the players is singular. The complexity measures we consider are communication complexity and round complexity. We achieve protocols that are close to optimal under both these measures. Joint work with Matt Franklin, Eike Kiltz, Payman Mohassel, and Kobbi Nissim.