Cryptology ePrint Archive: Report 2017/226

Faster LEGO-based Secure Computation without Homomorphic Commitments

Ruiyu Zhu and Yan Huang

Abstract: LEGO-style cut-and-choose is known for its asymptotic efficiency in realizing actively-secure computations. The dominant cost of LEGO protocols is due to wire-soldering the key technique enabling to put independently generated garbled gates together in a bucket to realize a logical gate. Existing wire-soldering constructions rely on homomorphic commitments and their security requires the majority of the garbled gates in every bucket to be correct.

In this paper, we propose an efficient construction of LEGO protocols that does not use homomorphic commitments but is able to guarantee security as long as at least one of the garbled gate in each bucket is correct. Additionally, the faulty gate detection rate in our protocol doubles that of the state-of-the-art LEGO constructions. We have implemented our protocol and our experiments on several benchmark applications show that the performance of our approach is highly competitive in comparison with existing implementations.

Category / Keywords: cryptographic protocols / maliciously secure two-party computation

Date: received 4 Mar 2017, last revised 17 Mar 2017

Contact author: yh33 at indiana edu

Available format(s): PDF | BibTeX Citation

Version: 20170317:193614 (All versions of this report)

Short URL: ia.cr/2017/226

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]