2009/01/15 by Hongsong Shi, Shi, Hongsong, Shaoquan Jiang +5
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.CR #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0901.2192
An extended abstract of the older version was published in ISIT'09. The new version is polished in the writing style while some new results are also added
arxiv created 2009/11/08 · arxiv updated 2009/12/01
In a secure message transmission (SMT) scenario a sender wants to send a message in a private and reliable way to a receiver. Sender and receiver are connected by n vertex disjoint paths, referred to as wires, t of which can be controlled by an adaptive adversary with unlimited computational resources. In Eurocrypt 2008, Garay and Ostrovsky considered an SMT scenario where sender and receiver have access to a public discussion channel and showed that secure and reliable communication is possible when n ≥ t+1. In this paper we will show that a secure protocol requires at least 3 rounds of communication and 2 rounds invocation of the public channel and hence give a complete answer to the open question raised by Garay and Ostrovsky. We also describe a round optimal protocol that has constant transmission rate over the public channel.