Secure Multi-Party Computation Made Simple

Ueli Maurer

Third Conference on Security in Communication Networks — SCN 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2576, pp. 14–28, Sep 2002.

A simple approach to secure multi-party computation is presented. Unlike previous approaches, it is based on essentially no mathematical structure (like bivariate polynomials) or sophisticated sub-protocols (like zero-knowledge proofs). It naturally yields protocols secure for mixed (active and passive) corruption and general (as opposed to threshold) adversary structures, confirming the previous tight bounds in a simpler formulation and with simpler proofs. Due to their simplicity, the described protocols are well-suited for didactic purposes, which is a main goal of this paper.

BibTeX Citation

@inproceedings{Maurer02b,
    author       = {Ueli Maurer},
    title        = {Secure Multi-Party Computation Made Simple},
    editor       = {G. Persiano},
    booktitle    = {Third Conference on Security in Communication Networks --- SCN 2002},
    pages        = {14--28},
    series       = {Lecture Notes in Computer Science},
    volume       = {2576},
    year         = {2002},
    month        = {9},
    publisher    = {Springer-Verlag},
}