Sciweavers

28 search results - page 2 / 6
» Resilient Network Coding in the Presence of Byzantine Advers...
Sort
View
TIT
2008
106views more  TIT 2008»
13 years 4 months ago
Byzantine Modification Detection in Multicast Networks With Random Network Coding
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
Tracey Ho, Ben Leong, Ralf Koetter, Muriel M&eacut...
COMSUR
2011
203views Hardware» more  COMSUR 2011»
12 years 4 months ago
Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious In
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 netw...
Maxwell Young, Raouf Boutaba
ICDCS
2011
IEEE
12 years 4 months ago
JR-SND: Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks
Abstract—Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exc...
Rui Zhang 0007, Yanchao Zhang, Xiaoxia Huang
PODC
2009
ACM
14 years 5 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
DSN
2008
IEEE
13 years 11 months ago
Byzantine replication under attack
Existing Byzantine-resilient replication protocols satisfy two standard correctness criteria, safety and liveness, in the presence of Byzantine faults. In practice, however, fault...
Yair Amir, Brian A. Coan, Jonathan Kirsch, John La...