Abstract
In a decentralized network system, an authenticated node is referred to as a Byzantine node, if it is fully controlled by a traitor or an adversary, and can perform destructive behavior to disrupt the system. Typically, Byzantine nodes together or individually attack point-to-point information propagation by denying or faking messages. In this paper, we assume that Byzantine nodes can protect themselves from being identified by authentication mechanisms. We present an authentication-free, gossip-based application-level propagation mechanism called LASIRC, in which “healthy” nodes utilize Byzantine features to defend against Byzantine attacks. We show that LASIRC is robust against message-denying and message-faking attacks. Our experimental studies verify LASIRC’s effectiveness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Suri, N., Walter, C.J., Hugue, M.M.: Advances in Ultra-Dependable Distributed Systems. IEEE Computer Society Press, Los Alamitos (1995)
Harry, C., Li, A.C., et al.: Bar gossip. In: USENIX OSDI, pp. 191–204 (2006)
Jubin, J., Tornow, J.D.: The darpa packet radio network protocols. Proceedings of the IEEE 75(1), 21–32 (1987)
Han, K., et al.: Exploiting slack for scheduling dependent, distributable real-time threads in mobile ad hoc networks. In: 15th International Conference on Real-Time and Network Systems (RTNS 2007) (March 2007)
Freebersyser, J.A., Macker, J.P.: Realizing the network-centric warfare vision: network technology challenges and guidelines. In: IEEE Military Communications Conference (MILCOM), pp. 267–271. IEEE Computer Society Press, Los Alamitos (2001)
Van Renesse, R., Birman, K.P., Vogels, W.: Astrolabe: A robust and scalable technologyfor distributed system monitoring, management, and data mining. ACM Transactions on Computer Systems (TOCS) 21(3), 164–206 (2003)
Hu, Y.C., A.P., Johnson, D.B.: Packet leashes: A defense against wormhole attacks in wireless ad hoc networks. In: The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003) (April 2003)
Birman, K.P., Hayden, M., et al.: Bimodal multicast. ACM Transactions on Computer Systems (TOCS) 17(2), 41–88 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, K., Ravindran, B., Jensen, E.D. (2007). Byzantine-Tolerant, Information Propagation in Untrustworthy and Unreliable Networks. In: Enokido, T., Barolli, L., Takizawa, M. (eds) Network-Based Information Systems. NBiS 2007. Lecture Notes in Computer Science, vol 4658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74573-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-74573-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74572-3
Online ISBN: 978-3-540-74573-0
eBook Packages: Computer ScienceComputer Science (R0)