Multiparty Computations in Non-private Environments

Private multi-party computations is an intensively studied subject of modern cryptography. In general, private computation can be defined as follows: Consider a set of players, where each player knows an individual secret. The goal is to compute a function depending on these secrets such that after the computation none of the players knows anything about the secrets of others that cannot be derived from his own input and the result of the function. To compute the function, the players exchange messages with each other using secure links. For a formal definition of cryptographically secure privacy see [8] and for privacy in information theoretic sense see [5,2].

Editors and Affiliations

1. Fakultät für Mathematik, Universität Bielefeld, 100131, 33501, Bielefeld, Germany

   Rudolf Ahlswede

2. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

   Lars Bäumer , Ning Cai , Harout Aydinian  & Christian Deppe , ,  & 

3. Russian Academy of Sciences Institute of Problems of Information Transmission, Bol’shoi Karetnyi per. 19, 101447, Moscow, Russia

   Vladimir Blinovsky

4. Universität Bielefeld, Fakultät für Mathematik, Universitätsstr. 25, 33615, Bielefeld, Germany

   Haik Mashurian

Reprints and permissions

© 2006 Springer-Verlag Berlin Heidelberg

Policies and ethics