Advertisement

Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission

  • Abhinav Mehta
  • Shashank Agrawal
  • Kannan Srinathan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7129)

Abstract

For unconditionally reliable message transmission (URMT) in synchronous directed networks of n nodes, a subset of which may be malicious, it is well-known that the minimum connectivity requirements for zero-error (perfect) protocols to exist is strictly higher than those where a negligible yet non-zero error probability is allowed (Monte Carlo protocols) [12]. In this work, we study the minimum connectivity requirements for the existence of (a) synchronous Las Vegas, (b) asynchronous Monte Carlo, and (c) asynchronous Las Vegas protocols for URMT.

Interestingly, we prove that in any network, a synchronous Las Vegas URMT protocol exists if and only if an asynchronous Monte Carlo URMT protocol exists too. We further show that in any network, an asynchronous Las Vegas URMT protocol exists if and only if a synchronous perfect protocol exists as well. Thus, our results establish an interesting interplay between (im)perfectness, synchrony and connectivity for the case of URMT.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation. In: Proceedings of the 20th Symposium on Theory of Computing (STOC), pp. 1–10. ACM Press (1988)Google Scholar
  2. 2.
    Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC 1993: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 52–61. ACM, New York (1993)CrossRefGoogle Scholar
  3. 3.
    Choudhary, A., Patra, A., Ashwinkumar, B.V., Srinathan, K., Rangan, C.P.: On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 148–162. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Desmedt, Y.G., 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. Journal of the Association for Computing Machinery (JACM) 40(1), 17–47 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Franklin, M.K., Wright, R.N.: Secure Communication in Minimal Connectivity Models. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 346–360. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  8. 8.
    Hirt, M., Maurer, U.: Player Simulation and General Adversary Structures in Perfect Multi-party Computation. Journal of Cryptology 13(1), 31–60 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Mehta, A., Agrawal, S., Srinathan, K.: Brief Announcement: Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 201–203. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Patra, A., Choudhary, A., Rangan, C.: Constant phase efficient protocols for secure message transmission in directed networks. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, pp. 322–323. ACM, New York (2007)CrossRefGoogle Scholar
  11. 11.
    Shankar, B., Gopal, P., Srinathan, K., Rangan, C.P.: Unconditionally reliable message transmission in directed networks. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1048–1055. SIAM, Philadelphia (2008)Google Scholar
  12. 12.
    Srinathan, K., Pandu Rangan, C.: Possibility and complexity of probabilistic reliable communications in directed networks. In: Proceedings of 25th ACM Symposium on Principles of Distributed Computing, PODC 2006 (2006)Google Scholar
  13. 13.
    Yang, Q., Desmedt, Y.: Cryptanalysis of Secure Message Transmission Protocols with Feedback. In: Kurosawa, K. (ed.) Information Theoretic Security. LNCS, vol. 5973, pp. 159–176. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Abhinav Mehta
    • 1
  • Shashank Agrawal
    • 1
  • Kannan Srinathan
    • 1
  1. 1.Center for Security, Theory and Algorithmic Research (C-STAR)International Institute of Information TechnologyHyderabadIndia

Personalised recommendations