Cryptology ePrint Archive: Report 2008/141

Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality

Arpita Patra and Ashish Choudhury and C. Pandu Rangan and Kannan Srinathan

Abstract: We study the interplay of network connectivity and the issues related to the ‘possibility’, ‘feasibility’ and ‘optimality’ for unconditionally reliable message transmission (URMT) and unconditionally secure message transmission (USMT) in an undirected synchronous network, under the influence of an adaptive mixed adversary having unbounded computing power, who can corrupt some of the nodes in the network in Byzantine, omission, fail-stop and passive fashion respectively. We consider two types of adversary, namely threshold and non-threshold. One of the important conclusions we arrive at from our study is that allowing a negligible error probability significantly helps in the ‘possibility’, ‘feasibility’ and ‘optimality’ of both reliable and secure message transmission protocols. To design our protocols, we propose several new techniques which are of independent interest.

Category / Keywords: foundations /

Publication Info: A preliminary version of this paper appeared in INDOCRYPT 2007

Date: received 30 Mar 2008, last revised 18 Jan 2011

Contact author: arpitapatra_10 at yahoo co in

Available format(s): PDF | BibTeX Citation

Version: 20110118:113229 (All versions of this report)

Short URL: ia.cr/2008/141

Discussion forum: Show discussion | Start new discussion