A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm

Litsas, Chris; Pagourtzis, Aris; Sakavalas, Dimitris

doi:10.1007/978-3-642-39247-4_23

Cited by 12 publications

(14 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We present a new necessary and sufficient condition for CPA to be t-locally resilient by extending the notion of local pair cut of Pelc and Peleg [14] to the notion of partial local pair cut. Note that although equivalent conditions exist [16,12], the simplicity of the new condition allows to settle the open question of CPA Uniqueness [14] in the affirmative: we show that if any safe (non-faulty) algorithm achieves Broadcast in an ad hoc network then so does CPA. We next prove that computing the validity of the condition is NP-hard and observe that the latter negative result also has a positive aspect, namely that a polynomially bounded adversary is unable to design an optimal attack unless P = NP.…”

Section: Our Resultsmentioning

confidence: 89%

Reliable broadcast with respect to topology knowledge

2016

Self Cite

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

Section: Our Resultsmentioning

confidence: 89%

Reliable broadcast with respect to topology knowledge

2016

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Our Resultsmentioning

confidence: 89%

“…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. Finally, in [12] such a graph parameter was presented explicitly, together with an efficient 2-approximation algorithm for computing its value.…”

Section: Related Workmentioning

confidence: 99%

Reliable Broadcast with Respect to Topology Knowledge

Pagourtzis

Panagiotakos

Sakavalas

2014

Lecture Notes in Computer Science

Self Cite

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

“…The PKO provides knowledge on the topology of G. We reminded in Definition 1 that the MKLO is a partition of the nodes on the base of a topological conditions. It follows that it is possible to verify the MKLO on G with PKO through a modified breath-first search [11]. Proof.…”

Section: Detecting Dcpa Liveness On Restricted Tvgsmentioning

confidence: 99%

Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures

Bonomi

Farina

Tixeuil

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Ensuring reliable communication despite possibly malicious participants is a primary objective in any distributed system or network. In this paper, we investigate the possibility of reliable broadcast in a dynamic network whose topology may evolve while the broadcast is in progress. In particular, we adapt the Certified Propagation Algorithm (CPA) to make it work on dynamic networks and we present conditions (on the underlying dynamic graph) to enable safety and liveness properties of the reliable broadcast. We furthermore explore the complexity of assessing these conditions for various classes of dynamic networks.

show abstract

A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm

Cited by 12 publications

References 11 publications

Reliable broadcast with respect to topology knowledge

Reliable broadcast with respect to topology knowledge

Reliable Broadcast with Respect to Topology Knowledge

Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures

Contact Info

Product

Resources

About