Yehuda Lindell

Abstract of PhD Thesis (Weizmann Inst., 2002)

Title: On the Composition of Secure Multi-Party Computation

Available: the thesis (in PSfile) and a preface (by O.G.).

In the setting of multi-party computation, sets of two or more parties with private inputs wish to jointly compute some (predetermined) function of their inputs. This computation should be such that the outputs received by the parties are correctly distributed, and none of the parties learn anything beyond their prescribed output. This encompasses any distributed computing task and includes computations as simple as coin-tossing and broadcast, and as complex as electronic voting, electronic auctions, electronic cash schemes and anonymous transactions. The feasibility (and infeasibility) of multi-party computation has been extensively studied, resulting in a seemingly comprehensive understanding of what can and cannot be securely computed, and under what assumptions. However, most of this research relates only to the stand-alone setting, in which a single set of parties execute a single protocol in isolation. In contrast, in modern network settings, it is usually the case that many parties run many protocol executions. In this thesis, we study the feasibility of secure multi-party computation under this more realistic setting of general composition of protocols and executions. The main results presented are as follows:

Submitted to the Feinberg Graduate School of the Weizmann Institute of Science, July 2002.

Available: the thesis (in PSfile) and a preface (by O.G.).

Back to Oded Goldreich's homepage.