New Advances in Secure Multi-Party Computation

Abstract

We seek new advances in cryptographic secure multi-party computation (MPC): protocols that enable mutually distrusting parties to jointly emulate the correctness and secrecy guarantees of a trusted third party. This includes privacy-preserving computation across sensitive data sets, as well as eliminating single points of failure within a system. Despite tremendous potential for applications and progress in the design and optimization of secure computation protocols in the last decades, there still remain significant barriers toward general adoption. New foundational ideas in this domain can provide significant steps toward removing such barriers. Focus will be directed toward two complementary research efforts: 1. Secure Numerical Computations - We investigate new avenues toward efficient secure computation for numerical computations, inspired by a recent approach of the PI (Boyle et al TCC'19) via function secret sharing. 2. Secure Computation in Incomplete Networks - We propose new techniques for protocol design within these settings, as well as approaches for understanding the limitations and optimal achievable limits.

Document Details

Document Type
DoD Grant Award
Publication Date
Jan 21, 2022
Source ID
FA95502110046XX0

Entities

People

  • Elette Boyle

Organizations

  • Air Force Office of Scientific Research
  • Reichman University
  • United States Air Force

Tags

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Computational Fluid Dynamics (CFD)
  • Cybersecurity.
  • Neural Network Machine Learning.