Our resulting protocol improves upon the state-of-the-art both asymptotically and concretely. We validate these claims via several experiments demonstrating both the efficiency and scalability of our protocol:
- Efficiency: For three-party computation over a LAN, our protocol requires only 95 ms to evaluate AES. This is roughly a 700$\times$ improvement over the best prior work, and only 2.5$\times$ slower than the best known result in the two-party setting. In general, for $n$ parties our protocol improves upon prior work (which was never implemented) by a factor of more than $230n$, e.g., an improvement of 3 orders of magnitude for 5-party computation.
- Scalability: We successfully executed our protocol with a large number of parties located all over the world, computing (for example) AES with 128 parties across 5 continents in under 3 minutes. Our work represents the largest-scale demonstration of secure computation to date.
Category / Keywords: cryptographic protocols / multi-party computation, secure computation, garbled circuits Date: received 24 Feb 2017, last revised 22 May 2017 Contact author: wangxiao at cs umd edu Available format(s): PDF | BibTeX Citation Version: 20170522:114109 (All versions of this report) Short URL: ia.cr/2017/189 Discussion forum: Show discussion | Start new discussion