Activity: Talk or presentation types › Lecture and oral contribution
Description
I describe the cryptographic technique known as secure multiparty computation, where a number of parties can compute a function over all their local inputs, and make the result public, without any party having to learn the inputs of the other parties. The technique I focus on are closely related to coding theory: each input is represented by a code word, with each party knowing only one coordinate of the code word. The challenge is to compute on these shared inputs without leaking them. At the end of the talk I will sketch some other approaches and briefly discuss some practical applications.
Period
23 Apr 2009
Event title
4th Interdisciplinary Seminar on Applied Mathematics