On the complexity of verifiable secret sharing and multi-party computation

We then show an impossibility result indicating that asimilar equivalence does not hold for Multiparty Computation (MPC): we show that even if protocols are givenblack-box access for free to an idealized secret sharing scheme secure for the access structure in question, it isnot possible to handle all relevant access structures efficiently, not even if the adversary is passive and static. Inother words, general MPC can only be black-box reduced efficiently to secret sharing if extra properties of the secretsharing scheme used (such as linearity) are assumed. *Work done while employed at ETH Zurich, Comp. Sc. Dept.