Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung

Abstract: We present a robust secure methodology for computing functions that are represented as multivariate polynomials where parties hold different variables as private inputs. Our generic efficient protocols are fully black-box and employ threshold additive homomorphic encryption; they do not assume honest majority, yet are robust in detecting any misbehavior. We achieve solutions that take advantage of the algebraic structure of the polynomials, and are polynomial-time in all parameters (security parameter, polynomial size, polynomial degree, number of parties). We further exploit a “round table” communication paradigm to reduce the complexity in the number of parties.

External IDs:dblp:conf/acns/Dachman-SoledMRY11