Abstract
Traditional Byzantine resilient algorithms use 2fâ+â1 vertex-disjoint paths to ensure message delivery in the presence of up to f Byzantine nodes. The question of how these paths are identified is related to the fundamental problem of topology discovery. Distributed algorithms for topology discovery cope with a never ending task: dealing with frequent changes in the network topology and unpredictable transient faults. Therefore, algorithms for topology discovery should be self-stabilizing to ensure convergence of the topology information following any such unpredictable sequence of events. We present the first such algorithm that can cope with Byzantine nodes. Starting in an arbitrary global state, and in the presence of f Byzantine nodes, each node is eventually aware of all the other non-Byzantine nodes and their connecting communication links. Using the topology information, nodes can, for example, route messages across the network and deliver messages from one end user to another. We present the first deterministic, cryptographic-assumptions-free, self-stabilizing, Byzantine-resilient algorithms for network topology discovery and end-to-end message delivery. We also consider the task of r-neighborhood discovery for the case in which r and the degree of nodes are bounded by constants. The use of r-neighborhood discovery facilitates polynomial time, communication and space solutions for the above tasks. The obtained algorithms can be used to authenticate parties, in particular during the establishment of private secrets, thus forming public key schemes that are resistant to man-in-the-middle attacks of the compromised Byzantine nodes. A polynomial and efficient end-to-end algorithm that is based on the established private secrets can be employed in between periodical secret re-establishments.
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
Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: 10th Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 19-21, pp. 51â59 (1991)
Dolev, S.: Self-Stabilization. MIT Press (2000)
Lynch, N.: Distributed Computing. Morgan Kaufmann Publishers (1996)
Al-Azemi, F.M., Karaata, M.H.: Brief announcement: A stabilizing algorithm for finding two edge-disjoint paths in arbitrary graphs. In: DĂŠfago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 433â434. Springer, Heidelberg (2011)
Hadid, R., Karaata, M.H.: An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks. Comp. Comm. 32(5), 858â866 (2009)
Dubois, S., Masuzawa, T., Tixeuil, S.: Maximum metric spanning tree made byzantine tolerant. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 150â164. Springer, Heidelberg (2011)
Nesterenko, M., Tixeuil, S.: Discovering network topology in the presence of byzantine faults. IEEE Trans. Parallel Distrib. Syst. 20(12), 1777â1789 (2009), see errata via http://vega.cs.kent.edu/~mikhail/Research/topology.errata.html
Awerbuch, B., Sipser, M.: Dynamic networks are as fast as static networks (preliminary version). In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (SFCS 1988), pp. 206â220. IEEE Computer Society (1988)
Minsky, Y., Schneider, F.B.: Tolerating malicious gossip. Distributed Computing 16(1), 49â68 (2003)
Li, H.C., Clement, A., Wong, E.L., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: Bar gossip. In: 7th Symposium on Operating Systems Design and Implementation, OSDI 2006, Berkeley, CA, USA, pp. 191â204. USENIX Association (2006)
Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.C.: Gossiping in a multi-channel radio network. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 208â222. Springer, Heidelberg (2007)
Alvisi, L., Doumen, J., Guerraoui, R., Koldehofe, B., Li, H.C., van Renesse, R., TrĂŠdan, G.: How robust are gossip-based communication protocols? Operating Systems Review 41(5), 14â18 (2007)
Burmester, M., Le, T.V., Yasinsac, A.: Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks. Ad Hoc Net. 5(3), 313â323 (2007)
Fernandess, Y., Malkhi, D.: On spreading recommendations via social gossip. In: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), pp. 91â97. ACM (2008)
Drabkin, V., Friedman, R., Segal, M.: Efficient Byzantine broadcast in wireless ad-hoc networks. In: Proceedings of IEEE International Conference on Dependable Systems and Networks (DSN 2005), pp. 160â169. IEEE Computer Society (2005), Self-stabilizing Byzantine Resilient 57
Paquette, M., Pelc, A.: Fast broadcasting with byzantine faults. Int. J. Found. Comput. Sci. 17(6), 1423â1440 (2006)
Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols (extended abstract). In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (SFCS 1991), pp. 258â267. IEEE Computer Society (1991)
Dolev, S., Liba, O., Schiller, E.M.: Self-stabilizing Byzantine resilient topology discovery and message delivery. CoRR abs/1208.5620 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Š 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dolev, S., Liba, O., Schiller, E.M. (2013). Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery. In: Gramoli, V., Guerraoui, R. (eds) Networked Systems. NETYS 2013. Lecture Notes in Computer Science, vol 7853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40148-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-40148-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40147-3
Online ISBN: 978-3-642-40148-0
eBook Packages: Computer ScienceComputer Science (R0)