Secret Sharing MPC on FPGAs in the Datacenter
Pierre-Francois Wolfe, Rushi Patel, Robert Munafo, Mayank Varia, and, Martin Herbordt

TL;DR
This paper presents an FPGA-based secret sharing design for secure multi-party computation in datacenters, demonstrating significant resource efficiency improvements over CPU implementations.
Contribution
It introduces a novel FPGA implementation of secret sharing MPC protocols, showing substantial resource savings compared to prior CPU-based software solutions.
Findings
FPGA implementation uses at least 10× fewer resources than CPU-based methods.
Secret sharing MPC on FPGA is competitive in performance and resource efficiency.
The design accelerates MPC protocols, making secure computation more accessible in datacenters.
Abstract
Multi-Party Computation (MPC) is a technique enabling data from several sources to be used in a secure computation revealing only the result while protecting the original data, facilitating shared utilization of data sets gathered by different entities. The presence of Field Programmable Gate Array (FPGA) hardware in datacenters can provide accelerated computing as well as low latency, high bandwidth communication that bolsters the performance of MPC and lowers the barrier to using MPC for many applications. In this work, we propose a Secret Sharing FPGA design based on the protocol described by Araki et al. We compare our hardware design to the original authors' software implementations of Secret Sharing and to work accelerating MPC protocols based on Garbled Circuits with FPGAs. Our conclusion is that Secret Sharing in the datacenter is competitive and when implemented on FPGA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
