Multiparty computation, an introduction
D Catalano, R Cramer, G Di Crescenzo… - Contemporary …, 2005 - Springer
Contemporary cryptology, 2005•Springer
These lecture notes introduce the notion of secure multiparty computation. We introduce
some concepts necessary to define what it means for a multiparty protocol to be secure, and
survey some known general results that describe when secure multiparty computation is
possible. We then look at some general techniques for building secure multiparty protocols,
including protocols for commitment and verifiable secret sharing, and we show how these
techniques together imply general secure multiparty computation. Our goal with these notes …
some concepts necessary to define what it means for a multiparty protocol to be secure, and
survey some known general results that describe when secure multiparty computation is
possible. We then look at some general techniques for building secure multiparty protocols,
including protocols for commitment and verifiable secret sharing, and we show how these
techniques together imply general secure multiparty computation. Our goal with these notes …
These lecture notes introduce the notion of secure multiparty computation. We introduce some concepts necessary to define what it means for a multiparty protocol to be secure, and survey some known general results that describe when secure multiparty computation is possible. We then look at some general techniques for building secure multiparty protocols, including protocols for commitment and verifiable secret sharing, and we show how these techniques together imply general secure multiparty computation.
Our goal with these notes is to convey an understanding of some basic ideas and concepts from this field, rather than to give a fully formal account of all proofs and details. We hope the notes will be accessible to most graduate students in computer science and mathematics with an interest in cryptography.
Springer