optimal message transmission protocols with flexible parameters
In Secure message transmission ( SMT ) protocols two nodes in a network want to communicate securely, given that some of the nodes in the network are corrupted by an adversary with unlimited computational power . An SMT protocol uses multiple paths between the sender and a receiver to guarantee privacy and reliability of the message transmission. An (?, ?)-SMT protocol bounds the adversary's success probability of breaking privacy and reliability to ? and ?, respectively. Rate optimal SMT protocols have the smallest transmission rate (amount of communication per one bit of message). Rate optimal protocols have been constructed for a restricted set of parameters. In this paper we use wire virtualization method to construct new optimal protocols for a wide range of parameters using previously known optimal protocols. In particular, we design, for the first time, an optimal 1-round (0, ?)-SMT protocol for n = (2 + c ) t , c ? 1/ t , where n is the number of paths between the sender and the receiver, up to t of which are controlled by the adversary. We also design an optimal 2-round (0, 0)-SMT protocol for n = (2 + c ) t , c ? 1/ t , with communication cost better than the known protocols. The wire virtualization method can be used to construct other protocols with provable properties from component protocols.
secure message transmission privacy reliability wireless sensor networks information-theoretic cryptography cryptographic protocols key distribution