Multiparty Computations in Non-private Environments

• Published in: General Theory of Information Transfer and Combinatorics pp. 1097 - 1099
• Main Author: Liśkiewicz, M.
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2006
• Series: Lecture Notes in Computer Science
• Subjects: Boolean Function; Bridge Node; Random String; Secure Link; Secure Privacy
• ISBN: 9783540462446; 3540462449
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11889342_80

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].