Cryptology ePrint Archive: Report 2021/978

Polymath: Low-Latency MPC via Secure Polynomial Evaluations and its Applications

Donghang Lu and Albert Yu and Aniket Kate and Hemanta Maji

Abstract: While the practicality of secure multi-party computation (MPC) has been extensively analyzed and improved over the past decade, we are hitting the limits of efficiency with the traditional approaches of representing the computed functionalities as generic arithmetic or Boolean circuits. This work follows the design principle of identifying and constructing fast and provably-secure MPC protocols to evaluate useful high-level algebraic abstractions; thus, improving the efficiency of all applications relying on them. We present Polymath, a constant-round secure computation protocol suite for the secure evaluation of (multi-variate) polynomials of scalars and matrices, functionalities essential to numerous data-processing applications. Using precise natural precomputation and high-degree of parallelism prevalent in the modern computing environments, Polymath can make latency of secure polynomial evaluations of scalars and matrices independent of polynomial degree and matrix dimensions.

We implement our protocols over the HoneyBadgerMPC library and apply them to two prominent secure computation tasks: privacy-preserving evaluation of decision trees and privacy-preserving evaluation of Markov processes. For the decision tree evaluation problem, we demonstrate the feasibility of evaluating high-depth decision tree models in a general n-party setting. For the Markov process application, we demonstrate that Polymath can compute large powers of transition matrices with better online time and less communication.

Category / Keywords: cryptographic protocols / Secure multi-party computation.

Date: received 21 Jul 2021

Contact author: lu562 at purdue edu

Available format(s): PDF | BibTeX Citation

Version: 20210722:092415 (All versions of this report)

Short URL: ia.cr/2021/978


[ Cryptology ePrint archive ]