Multiparty Computations in Non-private Environments

  • M. Liśkiewicz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4123)


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


Boolean Function Secure Privacy Random String Secure Link Bridge Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bar-Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information, and communication. IEEE Trans. Inform. Theory 39, 1930–1943 (1993)MATHCrossRefMathSciNetGoogle Scholar
  2. 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
  3. 3.
    Bläser, M., Jakoby, A., Liśkiewicz, M., Siebert, B.: Private computation — k-connected versus 1-connected networks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 194–209. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 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. 5.
    Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: 20th STOC, pp. 11–19 (1988)Google Scholar
  6. 6.
    Kushilevitz, E.: Privacy and communication complexity. SIAM J. Discrete Math. 5(2), 273–284 (1992)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Orlitsky, A., El Gamal, A.: Communication with secrecy constraints. In: 16th STOC, pp. 217–224 (1984)Google Scholar
  8. 8.
    Yao, A.C.-C.: Protocols for secure computations. In: 23rd FOCS, pp. 160–164 (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • M. Liśkiewicz

There are no affiliations available

Personalised recommendations