Elsevier

Discrete Applied Mathematics

Volume 154, Issue 2, 1 February 2006, Pages 370-381
Discrete Applied Mathematics

Secure multi-party computation made simple

https://doi.org/10.1016/j.dam.2005.03.020Get rights and content
Under an Elsevier user license
open archive

Abstract

Known secure multi-party computation protocols are quite complex, involving non-trivial mathematical structures and sub-protocols. The purpose of this paper is to present a very simple approach to secure multi-party computation with straight-forward security proofs. This approach naturally yields protocols secure for mixed (active and passive) corruption and general (as opposed to threshold) adversary structures, confirming the previously proved tight bounds in a simpler framework. Due to their simplicity, the described protocols are well-suited for didactic purposes, which is a main goal of this paper.

Keywords

Secure multi-party computation
Verifyable secret sharing
Adversary structures

Cited by (0)

The results of this paper were first presented at the Cryptography Workshop in Luminy in September 1999, and later appeared in [20].

1

Supported in part by the Swiss National Science Foundation [20].