Secure Multi-Party Computation over Networks

Yasuaki NISHITANI  Yoshihide IGARASHI  

IEICE TRANSACTIONS on Information and Systems   Vol.E83-D   No.3   pp.561-569
Publication Date: 2000/03/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: INVITED SURVEY PAPER
Category: Parallel and Distributed Algorithms
security,  secure protocols,  multi-party computation,  cryptography,  

Full Text: PDF>>
Buy this Article

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 including election over the internet, electric contracts, private and secret database, joint signatures, and others. A number of techniques for the problem have been proposed. Secure protocols for multi-paty computation known so far are mainly based on threshold secret sharing, verifiable secret sharing, zero-knowledge proofs, and error-correcting codes. We survey important and interesting results on secure multi-party computation under the existence of various types of adversaries.