March 14, 2019, 2:00 PM - 2:30 PM
Barrister's Hall - first floor
Boston University Law School
765 Commonwealth Avenue
Boston, MA 02215
Kinan Dak Albab, Boston University
Secure multi-party computation (MPC) is a cryptographic primitive that enables several parties to compute jointly over their collective private data sets. Over the past decade, a number of general and special-purpose MPC software frameworks have been developed. The designs of these frameworks focus on optimizing commonly used primitives or on providing efficient MPC implementations of specific algorithms. However, they have certain limitations that hinder their adoption (and consequently the adoption of MPC) in practical real-world applications: (1) Many of these frameworks are built using legacy software stacks or domain specific languages that make them difficult to use as part of a larger application. (2) Existing frameworks do not provide easy-to-use abstractions for expressing asymmetries in the roles and capabilities of participating parties. (3) Existing frameworks are often tied to the underlying assumptions that are used to optimize their protocols; customizing them to support a similar set of assumptions, or updating them with new primitives, is non-trivial. (4) Deploying and using MPC applications built with these frameworks requires substantial technical, logistical, and maintenance effort and expertise; detection and recovery from failures during deployment must be done manually.