Abstract
We study the problem of unconditionally reliable message transmission (URMT), where a sender S and a receiver R are part of a synchronous network modeled as a directed hypergraph, a part of which may be under the influence of an adversary having unbounded computing power. S intends to transmit a message m to R, such that R should correctly obtain S’s message with probability at least (1 − δ) for arbitrarily small δ> 0. However, unlike most of the literature on this problem, we assume the adversary modeling the faults is threshold mixed, and can corrupt different set of nodes in Byzantine, passive and fail-stop fashion simultaneously. The main contribution of this work is the complete characterization of URMT in directed hypergraph tolerating such an adversary, which is done for the first time in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 502–517. Springer, Heidelberg (2002)
Franklin, M., Yung, M.: Secure hypergraphs: Privacy from partial broadcast. In: Proc. of 27th Ann. Symposium on Theory of Computing, pp. 36–44 (1995)
Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. of 21st ACM STOC, pp. 73–85 (1989)
Shankar, B., Gopal, P., Srinathan, K., Pandu Rangan, C.: Unconditional reliable message transmision in directed networks. In: Proc. of SODA 2008 (2008)
Srinathan, K., Patra, A., Choudhary, A., Pandu Rangan, C.: Unconditionally reliable message transmission in directed hypergraphs. Cryptology Eprint Archive Report 2008/371
Srinathan, K., Pandu Rangan, C.: Possibility and complexity of probabilistic reliable communication in directed networks. In: Proc. of 25th PODC, pp. 265–274. ACM Press, New York (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srinathan, K., Patra, A., Choudhary, A., Rangan, C.P. (2008). Unconditionally Reliable Message Transmission in Directed Hypergraphs. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds) Cryptology and Network Security. CANS 2008. Lecture Notes in Computer Science, vol 5339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89641-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-89641-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89640-1
Online ISBN: 978-3-540-89641-8
eBook Packages: Computer ScienceComputer Science (R0)