Multiparty Computation Research

Опубликовано 9 октября 2018, 20:49

In this talk I will cover two topics. I will present MPyC, an open-source Python framework for rapid prototyping of MPC protocols, which is being developed at TU Eindhoven. Also, I will present a new MPC protocol for securely solving a full-rank linear system over the rational numbers. More precisely, given a square full-rank matrix with integral coefficients, whose elements are secret-shared among multiple parties, the parties’ goal is to compute the inverse (over Q) in secret-shared form, without leaking any information. Finally I will demonstrate the usefulness of MPyC in practice, by means of explaining step-by-step the MPyC-implementation our new protocol for secure linear algebra.

See more at microsoft.com/en-us/research/v...