Information Security and Cryptography Research Group

Secure Multi-party Computation made Simple

Ueli Maurer

Discrete Applied Mathematics, vol. 154, pp. 370–381, 2006.

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.

BibTeX Citation

    author       = {Ueli Maurer},
    title        = {Secure Multi-party Computation made Simple},
    journal      = {Discrete Applied Mathematics},
    pages        = {370--381},
    volume       = {154},
    year         = {2006},

Files and Links