Authors: Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra
Addresses: Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600036, India. ' Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600036, India. ' Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai 600036, India. ' International Institute of Information Technology, Gachibowli 500 032, Hyderabad, India. ' Department of Computer Science and Engineering, University of Washington, Seattle, Washington 98133, USA
Abstract: We study the problem of perfectly reliable message transmission (PRMT) and perfectly secure message transmission (PSMT) in an undirected synchronous network tolerating an all powerful threshold mobile Byzantine adversary. Specifically, we show that the mobility of the threshold adversary does not affect the possibility and optimality of PRMT and PSMT protocols. We also characterise PSMT in directed networks tolerating mobile adversary. All existing PRMT and PSMT protocols abstract the paths between the sender and the receiver as wires, neglecting the intermediate nodes in the paths, thus causing significant over estimation in the communication and round complexity of protocols. Here, we consider the underlying paths as a whole instead of abstracting them as wires and derive a tight bound on the number of rounds required to achieve reliable communication tolerating a threshold mobile adversary with arbitrary roaming speed. Finally, we briefly study PRMT and PSMT protocols in the presence of non-threshold mobile Byzantine adversary. Even though the characterisation for PRMT/PSMT is shown to be same against both threshold static and threshold mobile adversary (in this article), we show that the characterisation for PRMT/PSMT against non-threshold static and non-threshold mobile adversary are not same.
Keywords: communication efficiency; information theoretic security; mobile adversary; unbounded computing power; reliability; message transmission; undirected synchronous networks; mobility; threshold adversary; cryptography.
International Journal of Applied Cryptography, 2009 Vol.1 No.3, pp.200 - 224
Available online: 24 Feb 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article