Secure message transmission in asynchronous networks.

Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan

Abstract: In the Perfectly Secure Message Transmission (PSMT) problem, a sender S and a receiver R are part of a distributed network and connected through n node disjoint paths, also called as wires , among which at most t wires are controlled by a static, Byzantine adversary A t s t a t i c , having unbounded computing power . S has a message m , which S intends to send to R . The challenge is to design a protocol, such that at the end of the protocol, R should correctly output m without any error (perfect reliability) and A t s t a t i c should not get any information about m , whatsoever, in information theoretic sense (perfect security). The problem of Statistically Secure Message Transmission (SSMT) is same as PSMT, except that R should correctly output m with very high probability. Sayeed and Abu-Amara (1995) [37] have given a PSMT protocol in an asynchronous network tolerating A t s t a t i c , where S and R are connected by n