Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary

In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, modeled as an arbitrary directed graph. Some of the intermediate nodes between S and R can be under the control of the adversary having unbounded computing power. Desmedt and Wang [4] have given the characterization of USMT in directed networks. However, in their model, the underlying is abstracted as directed node disjoint paths (also called as wires/channels) between S and R, where the intermediate nodes are oblivious, message passing nodes and perform no other computation. In this work, we first show that the characterization of USMT given by Desmedt et.al [4] does not hold good for arbitrary directed networks, where the intermediate nodes perform some computation, beside acting as message forwarding nodes. We then give the true characterization of USMT in arbitrary directed networks. As far our knowledge is...

• Type: Conference
• Year: 2009
• Where: CCS
• Authors: Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan
• Keywords: Arbitrary Directed Graph, Arbitrary Directed Networks, CCS 2009, Intermediate Nodes, Security Privacy