Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries

  • M. V. N. Ashwin Kumar
  • K. Srinathan
  • C. Pandu Rangan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2384)


We initiate the study of perfectly secure multiparty computation over asynchronous networks tolerating generalized adversaries. The classical results in information-theoretically secure asynchronous multiparty computation among n players state that less than \( \frac{n} {4} \) active adversaries can be tolerated in the perfect setting [4]. Strictly generalizing these results to the non-threshold setting, we show that perfectly secure asynchronous multiparty computation among n players tolerating the adversary structure \( \mathcal{A} \) is possible if and only if the union of no four sets in the adversary structure cover the full set of players. The computation and communication complexities of the presented protocols are polynomial in the size of the maximal basis of the adversary structure. Our results generalize the results of [16,10] to the asynchronous setting. Furthermore, when restricted to the threshold setting, the protocols of this paper result in solutions as good as the best known asynchronous threshold protocols for the perfect setting. Incidentally, the problems of designing efficient asynchronous secure protocols and adapting the efficiency improvement techniques of the threshold setting to the non-threshold setting were mentioned as open in [18,17].


Access Structure Secure Computation Arithmetic Circuit Byzantine Agreement Generalize Adversary 
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.
    Donald Beaver. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology, pages 75–122, 1991.Google Scholar
  2. 2.
    Donald Beaver, Joan Feigenbaum, Joe Kilian, and Phillip Rogaway. Security with low communication overhead. In CRYPTO’ 90, pages 62–76, 1990.Google Scholar
  3. 3.
    Donald Beaver, Silvio Micali, and Phillip Rogaway. The round complexity of secure protocols. In Proceedings of 22nd ACM STOC, pages 503–513, 1990.Google Scholar
  4. 4.
    M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computations. In Proceedings of 25th ACM STOC, pages 52–61, 1993.Google Scholar
  5. 5.
    M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of 20th ACM STOC, pages 1–10, 1988.Google Scholar
  6. 6.
    M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computation with optimal resilience. In Proceedings of 13th ACM PODC, pages 183–192, 1994.Google Scholar
  7. 7.
    R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143–202, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    R. Canetti and T. Rabin. Optimal asynchronous byzantine agreement. In Proceedings of 25th ACM STOC, pages 42–51, 1993.Google Scholar
  9. 9.
    D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proceedings of 20th ACM STOC, pages 11–19, 1988.Google Scholar
  10. 10.
    R. Cramer, I. Damgard, and U. Maurer. Efficient general secure multiparty computation from any linear secret sharing scheme. In EUROCRYPT2000, LNCS, Springer-Verlag, 2000.Google Scholar
  11. 11.
    Ronald Cramer, Ivan Damgard, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. In EUROCRYPT’ 99, volume 1592 of LNCS, pages 311–326, 1999.Google Scholar
  12. 12.
    Matthew K. Franklin and Moti Yung. Communication complexity of secure computation. In Proceedings of 24th ACM STOC, pages 699–710, 1992.Google Scholar
  13. 13.
    Rosario Gennaro, Micheal O. Rabin, and Tal Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proceedings of 17th ACM PODC, 1998.Google Scholar
  14. 14.
    O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In 19th ACM STOC, pages 218–229. ACM Press, 1987.Google Scholar
  15. 15.
    M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multiparty computation. In 16th ACM PODC, pages 25–34, August 1997.Google Scholar
  16. 16.
    M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31–60, April 2000.Google Scholar
  17. 17.
    Martin Hirt and Ueli Maurer. Robustness for free in unconditional multi-party computation. In CRYPTO’ 01, LNCS. Springer-Verlag, 2001.Google Scholar
  18. 18.
    Martin Hirt, Ueli Maurer, and Bartosz Przydatek. Efficient multi-party computation. In ASIA CRYPT 2000, LNCS. Springer-Verlag, December 2000.Google Scholar
  19. 19.
    M. V. N. Ashwin Kumar, K. Srinathan, and C. Pandu Rangan Asynchronous Perfectly Secure Computation tolerating Generalized Adversaries Technical Report, IITM, Chennai, February 2002.Google Scholar
  20. 20.
    M. Karchmer and A. Wigderson. On span programs. In Proceedings of the 8th Annual IEEE Structure in Complexity Theory, pages 102–111, 1993.Google Scholar
  21. 21.
    S. Micali and P. Rogaway. Secure computation. In CRYPTO’91, volume 576 of LNCS, pages 392–404. Springer-Verlag, 1991.Google Scholar
  22. 22.
    S. Micali and P. Rogaway. Secure Computation: The information theoretic case., 1998. Former version: Secure Computation, In CRYPTO’ 91, volume 576 of LNCS, pages 392–404, Springer-Verlag, 1991.Google Scholar
  23. 23.
    T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of 21st ACM STOC, pages 73–85, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • M. V. N. Ashwin Kumar
    • 1
  • K. Srinathan
    • 1
  • C. Pandu Rangan
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyMadras ChennaiIndia

Personalised recommendations