Advertisement

Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited

  • Arpita Patra
  • Ashish Choudhary
  • C. Pandu Rangan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5229)

Abstract

In this paper, we design URMT and USMT protocols which are communication optimal in amortized sense and first of their kind.

Keywords

Error Probability Information Theoretic Security 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beerliová-Trubíniová, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 305–328. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1–10 (1988)Google Scholar
  3. 3.
    Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proc. of FOCS 1988, pp. 11–19 (1988)Google Scholar
  4. 4.
    Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 502–517. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. JACM 40(1), 17–47 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Franklin, M., Wright, R.: Secure communication in minimal connectivity models. Journal of Cryptology 13(1), 9–30 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Patra, A., Choudhary, A., Pandu Rangan, C.: Unconditionally reliable and secure message transmission in directed networks revisited. Cryptology ePrint Archive, Report 2008/262Google Scholar
  8. 8.
    Patra, A., Choudhary, A., Srinathan, K., Pandu Rangan, C.: Unconditionally reliable and secure message transmission in undirected synchronous networks: Possibility, feasibility and optimality. Cryptology ePrint Archive, Report 2008/141Google Scholar
  9. 9.
    Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73–85 (1989)Google Scholar
  10. 10.
    Shanker, B., Gopal, P., Srinathan, K., Pandu Rangan, C.: Unconditional reliable message transmision in directed networks. In: Proc. of SODA 2008 (2008)Google Scholar
  11. 11.
    Srinathan, K., Narayanan, A., Rangan, C.P.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545–561. Springer, Heidelberg (2004)Google Scholar
  12. 12.
    Wang, Y., Desmedt, Y.: Perfectly secure message transmission revisited (manuscript), www.sis.uncc.edu/yonwang/
  13. 13.
    Yao, A.C.: Protocols for secure computations. In: Proc. of 23rd IEEE FOCS, pp. 160–164 (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Arpita Patra
    • 1
  • Ashish Choudhary
    • 1
  • C. Pandu Rangan
    • 1
  1. 1.Dept of Computer Science and EngineeringIIT MadrasChennaiIndia

Personalised recommendations