Secure multi-party computation over networks

Consider a set of parties who do not trust each other but want to compute: some agreed function of their inputs in a secure way. This problem is known as multi-party computation. It has various interesting applications includ ing election over the internet, electric contracts, private and secret data base, joint signatures, and others. A number of techniques for the problem have been proposed. Secure protocols for multipaty computation known so car are mainly based on threshold secret sharing, verifiable secret sharing, z ero-knowledge proofs, and error-correcting codes. We survey important and i nteresting results on secure multi-party computation under the existence of various types of adversaries.