No abstract

Recent improvements in the state-of-the-art of MPC for nonfull-threshold access structures introduced the idea of using a collisionresistant hash functions and redundancy in the secret-sharing scheme to construct a communication-efficient MPC protocol which is computationallysecure against malicious adversaries, with abort. The prior work is based on replicated secret-sharing; in this work we extend this methodology to any LSSS implementing a Q2 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 communicationefficient online and offline protocols for MPC in the pre-processing model.