WCC 2003: Invited talks
- Ueli Maurer (Department of Computer Science, ETH Zürich,
Simplifying Secure Multi-Party Computation
After an introduction to secure multi-party computation and its
applications, we describe a new approach to unconditionally-secure
multi-party computation which is considerably simpler than all previous
approaches and therefore well-suited from a didactic viewpoint and for
giving simple security proofs. Unlike previous protocols it does not
rely on algebraic structure (like a finite field of certain size,
polynomials, or threshold circuits) and applies equally naturally to
threshold and general adversary structures.
- Jean-Charles Faugère. CNRS / Université Paris VI / INRIA,
Fast Gröbner. Algebraic cryptanalysis of HFE and Filter
Abstract. (ps, 60k)
- Ilya Dumer. University of
California, Riverside, USA.
Decoding of low-rate Reed-Muller codes with polylogarithmic
Abstract. (ps, 124k)
- Hans Dobbertin. Ruhr-Universität Bochum, Germany.
Nonlinear Boolean functions: recent progress, methods, and perspectives
Back to the Home Page of WCC 2003.
Last modification on February 17, 2003.