Fast Networks for High-Performance Distributed Trust
Preprint
Abstract
Organizations increasingly need to collaborate by performing a computation on their combined dataset, while keeping their data hidden from each other. Certain kinds of collaboration, such as collaborative data analytics and AI, require a level of performance beyond what current cryptographic techniques for distributed trust can provide. This is because the organizations run software in different trust domains, which can require them to communicate over WANs or the public Internet. In this paper, we explore how to instead run such applications using fast datacenter-type LANs. We show that, by carefully redesigning distributed trust frameworks for LANs, we can achieve up to order-of-magnitude better performance than naïvely using a LAN. Then, we develop deployment models for Distributed But Proximate Trust (DBPT) that allow parties to use a LAN while remaining physically and logically distinct. These developments make secure collaborative data analytics and AI significantly more practical and set new research directions for developing systems and cryptographic theory for high-performance distributed trust.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Authenticated BitGC for Actively Secure Rate-One 2PC2025
- Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing2025
- Multiparty Garbling from OT with Linear Scaling and RAM Support2025
- Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting)2020
- Plundervolt: How a Little Bit of Undervolting Can Create a Lot of TroubleIEEE Security & Privacy, 2020
- EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning2019
- Overdrive: Making SPDZ Great Again2018
- Efficient Garbling from a Fixed-Key Blockcipher2013
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits2013
- Improved Garbled Circuit: Free XOR Gates and Applications2008