Secure message transmission in asynchronous directed graphs

  • Authors:

  • Shashank Agrawal;Abhinav Mehta;Kannan Srinathan

  • Affiliations:

  • Center for Security, Theory and Algorithmic Research (C-STAR), International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research (C-STAR), International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research (C-STAR), International Institute of Information Technology, Hyderabad, India

  • Venue:
  • INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of secure message transmission (SMT) in asynchronous directed graphs, where an unbounded Byzantine adversary can corrupt some subset of nodes specified via an adversary structure. We focus on the particular variant (0, δ )-SMT, where the message remains perfectly private, but there is a small chance that the receiver R may not obtain it. This variant can be of two kinds: Monte Carlo - where R may output an incorrect message with small probability; and Las Vegas - where R never outputs an incorrect message. For a Monte Carlo (0, δ )-SMT protocol to exist in an asynchronous directed graph, we show that the minimum connectivity required in the network does not decrease even when privacy of the message being transmitted is not required. In the case of Las Vegas (0, δ )-SMT, we show that the minimum connectivity required matches exactly with the minimum connectivity requirements of the zero-error variant of SMT --- (0, 0)-SMT. For a network that meets the minimum connectivity requirements, we provide a protocol efficient in the size of the graph and the adversary structure. We also provide a protocol efficient in the size of the graph for an important family of graphs, when the adversary structure is threshold.