1 research outputs found
Communication Lower Bounds for Perfect Maliciously Secure MPC
We prove a lower bound on the communication complexity of perfect maliciously secure multiparty computation, in the standard model with parties of which are corrupted.
We show that for any and all large enough there exists a Boolean circuit with gates, where any perfectly secure protocol implementing must communicate bits.
The results easily extends to constructing similar circuits over any fixed finite field.
Our results also extend to the case where the threshold is suboptimal. Namely if the bound is
, which corresponds to known optimizations via packed secret-sharing.
Using known techniques, we also show an upper bound that matches the lower bound up to a constant factor (existing upper bounds are a factor off for Boolean circuits)