Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2003: Advances in Cryptology — EUROCRYPT 2003 pp 578–595Cite as

  1. Home
  2. Advances in Cryptology — EUROCRYPT 2003
  3. Conference paper
Round Efficiency of Multi-party Computation with a Dishonest Majority

Round Efficiency of Multi-party Computation with a Dishonest Majority

  • Jonathan Katz5,
  • Rafail Ostrovsky6 &
  • Adam Smith7 
  • Conference paper
  • First Online: 01 January 2003
  • 3547 Accesses

  • 46 Citations

  • 3 Altmetric

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2656)

Abstract

We consider the round complexity of multi-party computation in the presence of a static adversary who controls a majority of the parties. Here, n players wish to securely compute some functionality and up to n − 1 of these players may be arbitrarily malicious. Previous protocols for this setting (when a broadcast channel is available) require O(n) rounds. We present two protocols with improved round complexity: The first assumes only the existence of trapdoor permutations and dense cryptosystems, and achieves round complexity O(log n) based on a proof scheduling technique of Chor and Rabin [[13]]; the second requires a stronger hardness assumption (along with the non-black-box techniques of Barak [[2]]) and achieves O(1) round complexity.

Keywords

  • Proof System
  • Secure Protocol
  • Security Parameter
  • Broadcast Channel
  • Honest Party

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.

Supproted in part by U.S. Army Research Office Grant DAAD19-00-1-0177

Download conference paper PDF

References

  1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In Eighth ACM Symposium on Principles of Distributed Computing, pages 201–209, 1989.

    Google Scholar 

  2. B. Barak. Constant-round coin-tossing with a man in the middle. In 43rd IEEE Symposium on the Foundations of Computer Science, 2002. References are to the preliminary full version, available from the author’s web page.

    Google Scholar 

  3. B. Barak and O. Goldreich. Universal arguments of knowledge. In 17th IEEE Conference on Computational Complexity, pages 194–203, 2002.

    Google Scholar 

  4. D. Beaver. Foundations of secure interactive computing. In Advances in Cryptology — CRYPTO’ 91, volume 576 of Lecture Notes in Computer Science, pages 377–391. IACR, Springer-Verlag, Aug. 1991.

    CrossRef  Google Scholar 

  5. D. Beaver and S. Goldwasser. Multiparty computation with faulty majority. In Advances in Cryptology — CRYPTO’ 89, volume 435 of Lecture Notes in Computer Science, pages 589–590. IACR, Springer-Verlag, Aug. 1989.

    Google Scholar 

  6. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In 22nd ACM Symposium on the Theory of Computing, pages 503–513, 1990.

    Google Scholar 

  7. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th ACM Symposium on the Theory of Computing, pages 1–10, May 1988.

    Google Scholar 

  8. R. Canetti. Security and composition of multiparty cryptographic protocols. J. Cryptology, 13(1): 143–202, 2000.

    CrossRef  MATH  MathSciNet  Google Scholar 

  9. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd IEEE Symposium on the Foundations of Computer Science, pages 136–147, Las Vegas, Nevada, Oct. 2001. IEEE.

    Google Scholar 

  10. R. Canetti and M. Fischlin. Universally composable commitments. In Advances in Cryptology — CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 19–40. IACR, Springer, 2001.

    Google Scholar 

  11. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable twoparty and multi-party secure computation. In 34th ACM Symposium on the Theory of Computing, pages 494–503, Montréal, Québec, May 2002. ACM.

    Google Scholar 

  12. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In 20th ACM Symposium on the Theory of Computing, May 1988.

    Google Scholar 

  13. B. Chor and M. Rabin. Achieving independence in logarithmic number of rounds. In 6th ACM Symposium on Principles of Distributed Computing, 1987.

    Google Scholar 

  14. R. Cleve. Limits on the security of coin flips when half the processors are faulty. In 18th ACM Symposium on the Theory of Computing, pages 364–369, 1986.

    Google Scholar 

  15. R. Cramer and I. Damgård. Secure distributed linear algebra in a constant number of rounds. In Advances in Cryptology — CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science. IACR, Springer, 2001.

    Google Scholar 

  16. A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. In 33rd IEEE Symposium on the Foundations of Computer Science, pages 427–436. IEEE, 1992.

    Google Scholar 

  17. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM J. Computing, 30(2):391–437, 2000.

    CrossRef  MATH  MathSciNet  Google Scholar 

  18. D. Dolev and H. Strong. Authenticated algorithms for byzantine agreement. SIAM J. Computing, 12(4):656–666, 1983.

    CrossRef  MATH  MathSciNet  Google Scholar 

  19. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. In Advances in Cryptology — CRYPTO’ 89, volume 435 of Lecture Notes in Computer Science, pages 526–544. IACR, Springer-Verlag, Aug. 1989.

    Google Scholar 

  20. M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein, and A. Smith. Detectable Byzantine agreement secure against faulty majorities. In 21st ACM Symposium on Principles of Distributed Computing, pages 118–126, 2002.

    Google Scholar 

  21. R. Gennaro. Achieving independence efficiently and securely. In ACM Symposium on Principles of Distributed Computing, pages 130–136, 1995.

    Google Scholar 

  22. R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The round complexity of verifiable secret sharing and secure multicast. In 33rd ACM Symposium on the Theory of Computing, June 2001.

    Google Scholar 

  23. O. Goldreich. Secure multi-party computation. Electronic working draft, 2001.

    Google Scholar 

  24. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In 19th ACM Symposium on the Theory of Computing, pages 218–229. ACM, May 1987.

    Google Scholar 

  25. O. Goldreich and Y. Oren. Definitions and properties of zero-knowledge proof systems. J. Cryptology, 7(1):1–32, 1994.

    CrossRef  MATH  MathSciNet  Google Scholar 

  26. S. Goldwasser and L. A. Levin. Fair computation of general functions in presence of immoral majority. In Advances in Cryptology — CRYPTO’ 90, volume 537 of Lecture Notes in Computer Science, pages 77–93. Springer-Verlag, Aug. 1990.

    Google Scholar 

  27. S. Goldwasser and Y. Lindell. Secure computation without a broadcast channel. In 16th International Symposium on Distributed Computing (DISC), 2002.

    Google Scholar 

  28. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In 41nd IEEE Symposium on the Foundations of Computer Science, Redondo Beach, CA, Nov. 2000. IEEE.

    Google Scholar 

  29. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in private computations. SIAM J. Computing, 29(4), 2000.

    Google Scholar 

  30. Y. Lindell. Parallel coin-tossing and constant-round secure two-party computation. In Advances in Cryptology — CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 171–189. IACR, Springer, 2001.

    Google Scholar 

  31. S. Micali and P. Rogaway. Secure computation. In Advances in Cryptology — CRYPTO’ 91, volume 576 of Lecture Notes in Computer Science, pages 392–404. IACR, Springer-Verlag, Aug. 1991.

    CrossRef  Google Scholar 

  32. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for np using any one-way permutation. J. Cryptology, 11(2), 1998.

    Google Scholar 

  33. P. Rogaway. The Round Complexity of Secure Protocols. PhD thesis, MIT, 1991.

    Google Scholar 

  34. A. C.-C. Yao. How to generate and exchange secrets. In 27th IEEE Symposium on the Foundations of Computer Science, pages 162–167, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Maryland, College Park, MD

    Jonathan Katz

  2. Telcordia Technologies, Morristown, NJ

    Rafail Ostrovsky

  3. MIT Lab. for Computer Science, Cambridge, MA

    Adam Smith

Authors
  1. Jonathan Katz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rafail Ostrovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Adam Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technion — Israel Institute of Technology, Haifa, 32000, Israel

    Eli Biham

Rights and permissions

Reprints and Permissions

Copyright information

© 2003 International Association for Cryptologic Research

About this paper

Cite this paper

Katz, J., Ostrovsky, R., Smith, A. (2003). Round Efficiency of Multi-party Computation with a Dishonest Majority. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_36

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/3-540-39200-9_36

  • Published: 13 May 2003

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14039-9

  • Online ISBN: 978-3-540-39200-2

  • eBook Packages: Springer Book Archive

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature