Computer Science – Cryptography and Security
Scientific paper
2009-01-15
Computer Science
Cryptography and Security
An extended abstract of the older version was published in ISIT'09. The new version is polished in the writing style while som
Scientific paper
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 \geq 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 \emph{constant} transmission rate over the public channel.
Jiang Shaoquan
Safavi-Naini Rei
Shi Hongsong
Tuhin Mohammed Ashraful
No associations
LandOfFree
On Optimal Secure Message Transmission by Public Discussion does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Optimal Secure Message Transmission by Public Discussion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Optimal Secure Message Transmission by Public Discussion will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-589671