General Theory of Information Transfer and Combinatorics pp 1097-1099 | Cite as
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  and for privacy in information theoretic sense see [5,2].
KeywordsBoolean Function Secure Privacy Random String Secure Link Bridge Node
Unable to display preview. Download preview PDF.
- 2.Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th STOC, pp. 1–10 (1988)Google Scholar
- 4.Bläser, M., Jakoby, A., Liśkiewicz, M., Siebert, B.: Privacy in non-private environments, SIIM TR A-03-10, Unverity Lübeck (2003)Google Scholar
- 5.Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: 20th STOC, pp. 11–19 (1988)Google Scholar
- 7.Orlitsky, A., El Gamal, A.: Communication with secrecy constraints. In: 16th STOC, pp. 217–224 (1984)Google Scholar
- 8.Yao, A.C.-C.: Protocols for secure computations. In: 23rd FOCS, pp. 160–164 (1982)Google Scholar