Advertisement

The Round Complexity of Verifiable Secret Sharing: The Statistical Case

  • Ranjit Kumaresan
  • Arpita Patra
  • C. Pandu Rangan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6477)

Abstract

We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good “test case” for our understanding of round complexity in general; moreover, VSS is important in its own right as a central building block for, e.g., Byzantine agreement and secure multi-party computation.

The round complexity of perfect VSS was settled by Gennaro et al. (STOC 2001) and Fitzi et al. (TCC 2006). In a surprising result, Patra et al. (Crypto 2009) recently showed that if a negligible probability of error is allowed, the previous bounds no longer apply. We settle the key questions left open by their work, and in particular determine the exact round complexity of statistical VSS with optimal threshold. Let n denote the number of parties, at most t of whom are malicious. Their work showed that 2-round statistical VSS is impossible for t ≥ n/3. We show that 3-round statistical VSS is possible iff t < n/2. We also give an efficient 4-round protocol for t < n/2.

Keywords

Secret Sharing Check Point Reconstruction Phase Negligible Probability 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.

References

  1. 1.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 1–10. ACM Press, New York (1988)Google Scholar
  2. 2.
    Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science (FOCS), pp. 383–395. IEEE, Los Alamitos (1985)CrossRefGoogle Scholar
  3. 3.
    Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311–326. Springer, Heidelberg (1999)Google Scholar
  4. 4.
    Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. Journal of the ACM 40(1), 17–47 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Fitzi, M., Garay, J.A., Gollakota, S., Pandu Rangan, C., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 329–342. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 580–589. ACM Press, New York (2001)Google Scholar
  7. 7.
    Katz, J., Koo, C.-Y., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks. Information and Computation 207(8), 889–899 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Patra, A., Choudhary, A., Rabin, T., Rangan, C.P.: The round complexity of verifiable secret sharing revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 487–504. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Patra, A., Choudhary, A., Pandu Rangan, C.: Round efficient unconditionally secure multiparty computation protocol. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 185–199. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    Patra, A., Choudhary, A., Pandu Rangan, C.: Simple and efficient asynchronous byzantine agreement with optimal resilience. In: Tirthapura, S., Alvisi, L. (eds.) PODC, pp. 92–101. ACM, New York (2009)CrossRefGoogle Scholar
  11. 11.
    Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 73–85. ACM Press, New York (1989)Google Scholar

Copyright information

© International Association for Cryptologic Research 2010

Authors and Affiliations

  • Ranjit Kumaresan
    • 1
  • Arpita Patra
    • 2
  • C. Pandu Rangan
    • 2
  1. 1.Dept. of Computer ScienceUniversity of MarylandUSA
  2. 2.Dept. of Computer ScienceIIT MadrasIndia

Personalised recommendations