A new parameter for a broadcast algorithm with locally bounded Byzantine faults

Ichimura, Atsuhiko; Shigeno, Maiko

doi:10.1016/j.ipl.2010.04.003

Cited by 32 publications

(28 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The F -locally bounded fault model has been studied in the context of fault-tolerant broadcasting [35], [36]. However, to the best of our knowledge, there are no prior works discussing the ffraction local model; our investigation of this model is inspired by ideas pertaining to contagion in social and economic networks [37], where a node will accept some new information (behavior or technology) if more than a certain fraction of its neighbors has adopted it.…”

Section: Scope Of Threatsmentioning

confidence: 99%

Resilient Asymptotic Consensus in Robust Networks

LeBlanc

Zhang

Koutsoukos

et al. 2013

IEEE J. Select. Areas Commun.

571

738

View full text Add to dashboard Cite

Abstract-This paper addresses the problem of resilient innetwork consensus in the presence of misbehaving nodes. Secure and fault-tolerant consensus algorithms typically assume knowledge of nonlocal information; however, this assumption is not suitable for large-scale dynamic networks. To remedy this, we focus on local strategies that provide resilience to faults and compromised nodes. We design a consensus protocol based on local information that is resilient to worst-case security breaches, assuming the compromised nodes have full knowledge of the network and the intentions of the other nodes. We provide necessary and sufficient conditions for the normal nodes to reach asymptotic consensus despite the influence of the misbehaving nodes under different threat assumptions. We show that traditional metrics such as connectivity are not adequate to characterize the behavior of such algorithms, and develop a novel graph-theoretic property referred to as network robustness. Network robustness formalizes the notion of redundancy of direct information exchange between subsets of nodes in the network, and is a fundamental property for analyzing the behavior of certain distributed algorithms that use only local information.

show abstract

Section: Scope Of Threatsmentioning

confidence: 99%

Resilient Asymptotic Consensus in Robust Networks

LeBlanc

Zhang

Koutsoukos

et al. 2013

IEEE J. Select. Areas Commun.

571

738

View full text Add to dashboard Cite

show abstract

“…The body of work on the locally-bounded scenario is larger and primarily centers about the grid model, although arbitrary topologies are considered by Pelc and Peleg [87] and Ichimura and Shigeno [88]. We can see that initial work focuses on feasibility; specifically, establishing upper and lower bounds on t for which reliable broadcast can be achieved.…”

Section: Summary Of Results and Discussionmentioning

confidence: 99%

Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference

Young

Boutaba

2011

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the network devices themselves. In the presence of antagonistic interference, reliable communication in sensor networks becomes an extremely challenging problem that, in recent years, has attracted significant attention from the research community.This survey presents the current state of affairs in the formulation of theoretical models for adversarial interference in sensor networks and the different algorithmic remedies developed by the research community. There is a particular focus on jamming adversaries and Byzantine faults as these capture a wide range of benign faults as well as malicious attacks. The models in the literature are examined and contrasted with the aim of discerning the underlying assumptions that dictate analytical bounds with regards to feasibility and a number of performance metrics such as communication complexity, latency, and energy efficiency. Limitations are also highlighted with a focus on how various results impact real world applications and, conversely, how the current sensor network technology informs newer models. Finally, directions for future research are discussed.

show abstract

“…Ichimura and Shigeno in [8] prove that the set splitting problem, known as NP-hard [6], can be reduced to the problem of computing the minimum integer t such that a t-local pair cut exists in a graph G. By generalizing the notion of the t-local pair cut to that of t-plp cut and defining the pLPC problem analogously one can use a nearly identical proof to that of [8] and show that the pLPC problem is NP-hard. For completeness the proof is given in the appendix.…”

Section: Hardness Of Plpcmentioning

confidence: 98%

“…They also provided an upper bound on the number of corrupted players t that can be locally tolerated in order to achieve Broadcast by any protocol, in terms of an appropriate graph parameter; they left the deduction of tighter bounds as an open problem. To this end, Ichimura and Shigeno [8] proposed an efficiently computable graph parameter which implies a more tight, but not exact, characterization of the class of graphs on which CPA achieves Broadcast. It had remained open until very recently to derive a tight parameter revealing the maximum number of traitors that can be locally tolerated by CPA in a graph G with dealer D. Such a parameter is implicit in the work of Tseng et al [16], who gave a necessary and sufficient condition for CPA Broadcast.…”

Section: Related Workmentioning

confidence: 99%

Reliable broadcast with respect to topology knowledge

2016

View full text Add to dashboard Cite

We study the Reliable Broadcast problem in incomplete networks against a Byzantine adversary. We examine the problem under the locally bounded adversary model of Koo (2004) and the general adversary model of Hirt and Maurer (1997) and explore the tradeoff between the level of topology knowledge and the solvability of the problem.We refine the local pair-cut technique of Pelc and Peleg (2005) in order to obtain impossibility results for every level of topology knowledge and any type of corruption distribution. On the positive side we devise protocols that match the obtained bounds and thus, exactly characterize the classes of graphs in which Reliable Broadcast is possible.Among others, we show that Koo's Certified Propagation Algorithm (CPA) is unique against locally bounded adversaries in ad hoc networks, that is, it can tolerate as many local corruptions as any other non-faulty algorithm; this settles an open question posed by Pelc and Peleg. We also provide an adaptation of CPA against general adversaries and show its uniqueness in this case too. To the best of our knowledge this is the first optimal algorithm for Reliable Broadcast in generic topology ad hoc networks against general adversaries.

show abstract

A new parameter for a broadcast algorithm with locally bounded Byzantine faults

Cited by 32 publications

References 4 publications

Resilient Asymptotic Consensus in Robust Networks

Resilient Asymptotic Consensus in Robust Networks

Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference

Reliable broadcast with respect to topology knowledge

Contact Info

Product

Resources

About