Perfectly Reliable Message Transmission

We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous network, a part of which is under the influence of an all powerful mobile Byzantine adversary. In ACISP'2007 Srinathan et. al. has proved that the connectivity requirement for PSMT protocols is same for both static and mobile adversary thus showing that mobility of the adversary has no effect on the possibility of PSMT (also PRMT) protocols. Similarly in CRYPTO 2004, Srinathan et. al. has shown that the lower bound on the communication complexity of any multiphase PSMT protocol is same for static and mobile adversary. The authors have also designed a O(t) phase1 protocol satisfying this bound where t is the maximum number of nodes corrupted by the Byzantine adversary. In this work, we design a three phase bit optimal PSMT protocol using a novel technique, whose communication complexity matches the lower boun...

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Arvind Narayanan, K. Srinathan, C. Pandu Rangan
• Keywords: Communication Complexity, IPL 2006, Mobile Adversary, PSMT Protocols