Pushing the Communication Barrier in Secure Computation using Lookup Tables

Abstract

Secure two-party computation has witnessed significant efficiency improvements in the recent years. Current implementations of protocols with security against passive adversaries generate and process data much faster than it can be sent over the network, even with a single thread. This paper introduces novel methods to further reduce the communication bottleneck and round complexity of semi-honest secure two-party computation. Our new methodology creates a trade-off between communication and computation, and we show that the added computing cost for each party is still feasible and practicable in light of the new communication savings. We first improve communication for Boolean circuits with 2-input gates by factor 1.9x when evaluated with the protocol of Goldreich-Micali-Wigderson (GMW). As a further step, we change the conventional Boolean circuit representation from 2-input gates to multi-input/multioutput lookup tables (LUTs) which can be programmed to realize arbitrary functions. We construct two protocols for evaluating LUTs offering a trade-off between online communication and total communication. Our most efficient LUT-based protocol reduces the communication and round complexity by a factor 2-4x for several basic and complex operations. Our proposed scheme results in a significant overall runtime decrease of up to a factor of 3x on several benchmark functions. Permission to freely reproduce all or part of this paper for noncommercial purposes is granted provided that copies bear this notice and the full citation on the first page. Reproduction for commercial purposes is strictly prohibited without the prior written consent of the Internet Society, the first-named author (for reproduction of an entire paper only), and the author's employer if the paper was prepared within the scope of employment.

Scalable Private Set Intersection Based on OT Extension

“…We instantiated the PRP of the server-aided PSI protocol in Kamara et al (2014) and the CRF in the ( 2 1 )-OT extension with fixed-key AES-128, and instantiated the RO and the CRF in the ( N 1 )-OT extension with SHA-256. We instantiated the CRF in the ( N 1 )-OT using SHA-256 instead of AES, since it needs to process inputs of 512 bit-length and AES only allows to process inputs with 128 bit when using fixed-key AES-128 or 256 bit when using the key schedule of AES-256 (Dessouky et al 2017). We implemented FFC (finite field cryptography) using the GMP library (v. 5.1.2), ECC using the Miracl library (v. 5.6.1), symmetric cryptographic primitives using OpenSSL (v. 1.0.1e), and used the OT extension implementation of Asharov et al (2013).…”

Recent Advances in Practical Secure Multi-Party Computation

“…3.2). More concretely, we have the protocols like table lookup [42], [50], the maximum/minimum value extraction [42], sorting [51]- [56], database join [57], [58], and floating point number computation [59]- [61] 3…”

PILOT: Practical Privacy-Preserving Indoor Localization Using OuTsourcing

“…While a XOR gate can be evaluated locally, an AND gate requires 2κ bits of communication in the setup phase and 4 bits in the online phase, as described in [59]. The communication of GMW can be further reduced at the cost of a higher computation complexity [62,63].…”