Putting Our Trust in the Implementation of MPC: Why and Why Not?
Time:
TBA, Sunday, September 14, 2025
Location:
TBA
Speaker:
- Fatemeh Ganji, Worcester Polytechnic Institute, USA
Abstract:
Secure multiparty computation (MPC) enables distrustful parties to jointly compute on their private inputs without disclosing anything besides the results. The cryptography community has known about practical and general-purpose implementations of MPC protocols for 30 years. Thanks to its immense impact on the field of cryptography, MPC continues to gain momentum. MPC has gained traction internationally over the past decade, owing to tremendous improvement in the performance of garbled circuit (GC) and secret-sharing protocols with available highly mature, open-source tools. Regarding the implementation maturity, especially for outsourced processing, these MPC paradigms have reached real-world deployment and market-ready levels.
As a prime example, given mature applications of GC and secret-sharing, it is not surprising that neural network (NN) applications have started adopting privacy-preserving techniques, as demonstrated in major stakeholders' publications and products. MPC-supported NNs are racing toward more efficient implementation and becoming practical by combining advancements in hardware/software design and progress achieved in MPC protocols, e.g., online/offline settings, to reduce communication costs.
Despite their theoretical soundness, MPC implementations in software and/or hardware can be vulnerable to attacks, as recent attacks targeting protocol implementations show. The devastating consequences of such attacks are clear: MPC-supported schemes intended for use in privacy/security-critical domains are no longer privacy-preserving and secure. This is understudied in the literature, although many implementation frameworks are open-source, paving the way for further research.
This tutorial highlights the importance of protecting MPC implementations against multiple attacks (see Figure 1). We focus on backdoor attacks, side-channel analysis (SCA), and fault attacks. Concretely, we will cover the following: (a) an introduction to privacy-preserving techniques, including differential privacy, trusted processors, and cryptographic approaches, where MPC and fully-homomorphic encryption are the most common approaches; (b) side-channel attacks against MPC implementations; (c) a taxonomy of MPC protocols used in private training and private inference tasks; (d) fault attacks against MPC-supported NNs; (e) potential countermeasure in MPC-supported NNs to protect them against side-channel and fault attack; (f) a taxonomy of state-of-the-art backdoor attacks against NNs; (g) MPC for protecting NNs against backdoor attacks and its challenges; (h) other novel applications of MPC implementations and their security; (i) a summary of open problems and future research directions. For the first time, this tutorial systematizes the knowledge of the reported results on various vulnerabilities in MPC-supported NNs and MPC protocols themselves, published in several papers at high-tier security conferences in the last few years. The ultimate goal of this tutorial is to bring the attention of our community to the vulnerabilities in protocol implementations beyond the usual targets discussed in side-channel and fault attack-related literature.
Requirements/Prerequisites:
The proposed tutorial is suitable for graduate students, academic researchers, industry practitioners, and government researchers working in the areas of hardware security, applied cryptography, and physical attacks. In particular, it would be most appealing to researchers working on the implementation security and privacy- preserving technologies. The general CHES community should also be interested in the proposed tutorial. We will provide motivation and background in privacy-preserving techniques for newcomers to this topic. For the more experienced, the tutorial will give a summary of the current state-of-the-art attacks, countermeasures, the challenges remaining, and promising new initiatives. Based on prior experience, we expect this tutorial to attract at least 50 participants.