Abstract
We study the interplay of network connectivity and the issues related to feasibility and optimality for probabilistic perfectly reliable message transmission (PPRMT) and probabilistic perfectly secure message transmission (PPSMT) in a synchronous network under the influence of a mixed adversary who possesses unbounded computing power and can corrupt different set of nodes in Byzantine, omission, failstop and passive fashion simultaneously. Our results show that that randomness helps in the possibility of multiphase PPSMT and significantly improves the lower bound on communication complexity for both PPRMT and PPSMT protocols!! © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Srinathan, K., Patra, A., Choudhary, A., & Rangan, C. P. (2007). Probabilistic perfectly reliable and secure message transmission - Possibility, feasibility and optimality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4859 LNCS, pp. 101–122). Springer Verlag. https://doi.org/10.1007/978-3-540-77026-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
