8th Estonian Winter School in Computer Science (EWSCS)
VIII Eesti Arvutiteaduse Talvekool (EATTK)
Palmse, Estonia
March 2 - 7, 2003
Ivan Damgård
DAIMI
Aarhus Universitet
Theory and practice of multiparty computation
Abstract
We will cover some basic concepts related to commitment schemes, zero knowledge protocols and secret sharing, and we will look at applications of this to practical protocols for distributed cryptography and electronic voting. We then cover some basic result in the theory of general secure multiparty computation (MPC), most importantly the result that given secure channels, general unconditionally secure MPC is possible, as long as less than a third of the players cheat actively. We also briefly discuss how similar techniques combined with public key cryptography can lead to solutions with cryptographic security assuming an open network.
Course materials
I. Damgård. Commitment schemes and zero-knowledge protocols. Course notes, 2002. [ps]
I. Damgård. On Sigma-protocols. Course notes, 2002. [ps]
I. Damgård. A note on distributed key generation for ElGamal encryption. Course notes. [ps]
R. Cramer, R. Gennaro, B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. Europ. Trans. Telecomm., v. 8, n. 3, pp. 481-490, 1997. [ps]
R. Cramer, I. Damgård. Multiparty Computation, an Introduction. Course notes, 2002. [ps]
I. Damgård. Secret sharing. Course notes, 2002. [ps]
- Slides from the EWSCS'03 course. [ppt]
About the Lecturer