Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary

Abstract

In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple parallel edges (called wires), each of which are directed from S to R or vice-versa. The unreliability of the network is modeled by a Byzantine adversary with infinite computing power. We investigate the problem with two different adversarial settings: (i) threshold and (ii) non-threshold. In [1], the authors have characterized PSMT against a t-active threshold adversary in directed networks. However, their PSMT protocol was exponential both in terms of number of phases and communication complexity. In addition, they also presented a polynomial phase PSMT protocol with n′ = max(3t − u + 1, 2t + 1) wires from S to R. In this paper, we significantly improve the exponential phase protocol and present an elegant and efficient three phase PSMT protocol with polynomial communication complexity (and computational complexity) with n =  max (3t − 2u + 1, 2t + 1) wires from S to R. Also with n′ =  max (3t − u + 1, 2t + 1) wires from S to R, we are able to further improve the communication complexity of our three phase PSMT protocol. Our second contribution in this paper is the first ever characterization for any two phase PSMT protocol. Finally, we also characterize PSMT protocol in directed networks tolerating non-threshold adversary. In [3], the authors have given the characterization for PSMT against non-threshold adversary. However, in their characterization, they have only considered the paths from S to R, excluding the feedback paths (i.e paths from R to S) and hence their characterization holds good only for single phase protocols. We characterize multiphase PSMT considering feedback paths.

A brief version of this paper appeared in [7] which permits full expanded version to appear elsewhere.