Reliable Broadcast with Respect to Topology Knowledge
暂无分享,去创建一个
[1] Sébastien Tixeuil,et al. Discovering Network Topology in the Presence of Byzantine Faults , 2009, IEEE Trans. Parallel Distributed Syst..
[2] Maiko Shigeno,et al. A new parameter for a broadcast algorithm with locally bounded Byzantine faults , 2010, Inf. Process. Lett..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[5] Ueli Maurer,et al. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract) , 1997, PODC '97.
[6] Shlomi Dolev,et al. Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery - (Extended Abstract) , 2012, NETYS.
[7] Aris Pagourtzis,et al. A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm , 2013, ADHOC-NOW.
[8] Matthias Fitzi,et al. Efficient Byzantine Agreement Secure Against General Adversaries , 1998, DISC.
[9] K. Srinathan,et al. On perfectly secure communication over arbitrary networks , 2002, PODC '02.
[10] Yoram Moses,et al. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds , 1998, SIAM J. Comput..
[11] Lewis Tseng,et al. Iterative Approximate Byzantine Consensus under a Generalized Fault Model , 2012, ICDCN.
[12] Andrzej Pelc,et al. Broadcasting with locally bounded Byzantine faults , 2005, Inf. Process. Lett..
[13] Chiu-Yuen Koo,et al. Broadcast in radio networks tolerating byzantine adversarial behavior , 2004, PODC '04.
[14] Moti Yung,et al. Perfectly secure message transmission , 1993, JACM.
[15] Lewis Tseng,et al. Broadcast using certified propagation algorithm in presence of Byzantine faults , 2012, Information Processing Letters.
[16] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.