Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4123))

  • 1766 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bar-Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information, and communication. IEEE Trans. Inform. Theory 39, 1930–1943 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Chapter  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 

  6. Kushilevitz, E.: Privacy and communication complexity. SIAM J. Discrete Math. 5(2), 273–284 (1992)

    Article  MATH  MathSciNet  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 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Liƛkiewicz, M. (2006). Multiparty Computations in Non-private Environments. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_80

Download citation

  • DOI: https://doi.org/10.1007/11889342_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46244-6

  • Online ISBN: 978-3-540-46245-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics