Trading Players for Efficiency in Unconditional Multiparty Computation

  • B. Prabhu
  • K. Srinathan
  • C. Pandu Rangan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2576)


In this paper, we propose a new player elimination technique and use it to design an efficient protocol for unconditionally secure multiparty computation tolerating generalized adversaries. Our protocol requires broadcast of O(nL 2 log(∣F∣) bits (broadcast is simulated using Byzantine agreement) while the non-cryptographic linear secret sharing based protocols, without player elimination, invoke Byzantine agreement sub-protocol for O(mL 3 log(∣F∣) bits, where m is the number of multiplication gates in the arithmetic circuit, over the finite field F, that describes the functionality of the protocol and L is the size of the underlying linear secret sharing scheme tolerating the given adversary structure.


secure multiparty computation generalized adversaries 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bea91.
    D. Beaver. Efficient multiparty protocols using circuit randomization. In CRYPTO’ 91, volume 576 of LNCS, pages 420–432, 1991.Google Scholar
  2. BGW88.
    M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th ACM STOC, pages 1–10, 1988.Google Scholar
  3. CDM00.
    R. Cramer, I. Damgard, and U. Maurer. Efficient general secure multiparty computation from any linear secret sharing scheme. In EUROCRYPT’00, volume 1807 of LNCS, 2000.Google Scholar
  4. FM98.
    M. Fitzi and U. Maurer. Efficient byzantine agreement secure against general adversaries. In DISC’ 98, volume 1499 of LNCS, pages 134–148, 1998.Google Scholar
  5. HM00.
    M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31–60, April 2000. Preliminary version appeared in 16th ACM PODC, pages 25-34, 1997.CrossRefMathSciNetGoogle Scholar
  6. HM01.
    M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In CRYPTO’ 01, volume 2139 of LNCS, 2001.Google Scholar
  7. HMP00.
    M. Hirt, U. Maurer, and B. Przydatek. Efficient multi-party computation. In ASIACRYPT’00, volume 1976 of LNCS, 2000.Google Scholar
  8. KW93.
    M. Karchmer and A. Wigderson. On span programs. In 8th IEEE Structure in Complexity Theory, pages 102–111, 1993.Google Scholar
  9. RB89.
    T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In 21st ACM STOC, pages 73–85, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • B. Prabhu
    • 1
  • K. Srinathan
    • 1
  • C. Pandu Rangan
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyMadras, ChennaiIndia

Personalised recommendations