International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited

Authors:
Arpita Patra
Ashish Choudhary
C. Pandu Rangan
Download:
URL: http://eprint.iacr.org/2008/262
Search ePrint
Search Google
Abstract: In this paper, we re-visit the problem of {\it unconditionally reliable message transmission} (URMT) and {\it unconditionally secure message transmission} (USMT) in a {\it directed network} under the presence of a threshold adaptive Byzantine adversary, having {\it unbounded computing power}. Desmedt et.al \cite{Desmedt} have given the necessary and sufficient condition for the existence of URMT and USMT protocols in directed networks. Though their protocols are efficient, they are not communication optimal. In this paper, we prove for the first time the lower bound on the communication complexity of URMT and USMT protocols in directed networks. Moreover, we show that our bounds are tight by giving efficient communication optimal URMT and USMT protocols, whose communication complexity satisfies our proven lower bounds.
BibTeX
@misc{eprint-2008-17939,
  title={Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited},
  booktitle={IACR Eprint archive},
  keywords={foundations /},
  url={http://eprint.iacr.org/2008/262},
  note={This is the full version of the paper which is going to appear in SCN 2008 arpitapatra_10@yahoo.co.in 14040 received 10 Jun 2008},
  author={Arpita Patra and Ashish Choudhary and C. Pandu Rangan},
  year=2008
}