Cryptology ePrint Archive: Report 2018/467

Error-Detecting in Monotone Span Programs with Application to Communication Efficient Multi-Party Computation

Nigel P. Smart and Tim Wood

Abstract: Recent improvements in the state-of-the-art of MPC for non-full-threshold access structures introduced the idea of using a collision-resistant hash functions and redundancy in the secret-sharing scheme to construct a communication-efficient MPC protocol which is computationally-secure against malicious adversaries, with abort. The prior work is based on replicated secret-sharing; in this work we extend this methodology to {\em any} multiplicative LSSS implementing a $Q_2$ access structure. To do so we need to establish a folklore property of error detection for such LSSS and their associated Monotone Span Programs. In doing so we obtain communication-efficient online and offline protocols for MPC in the pre-processing model.

Category / Keywords: cryptographic protocols /

Original Publication (with major differences): CT-RSA 2019

Date: received 17 May 2018, last revised 28 Nov 2018

Contact author: nigel smart at kuleuven be,t wood@kuleuven be

Available format(s): PDF | BibTeX Citation

Version: 20181128:121432 (All versions of this report)

Short URL: ia.cr/2018/467


[ Cryptology ePrint archive ]