Sciweavers

8 search results - page 1 / 2
» Practical Robust Communication in DHTs Tolerating a Byzantin...
Sort
View
ICDCS
2010
IEEE
13 years 8 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
IPL
2008
72views more  IPL 2008»
13 years 4 months ago
Reducing communication costs in robust peer-to-peer networks
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...
Jared Saia, Maxwell Young
ICC
2008
IEEE
125views Communications» more  ICC 2008»
13 years 11 months ago
Real-Time, Byzantine-Tolerant Information Dissemination in Unreliable and Untrustworthy Distributed Systems
—In unreliable and untrustworthy systems, information dissemination may suffer network failures and attacks from Byzantine nodes which are controlled by traitors or adversaries, ...
Kai Han, Guanhong Pei, Binoy Ravindran, E. Douglas...
SOSP
2007
ACM
14 years 1 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
DCOSS
2009
Springer
13 years 11 months ago
Speed Dating Despite Jammers
Many wireless standards and protocols today, such as WLAN and Bluetooth, operate on similar frequency bands. While this permits an efficient usage of the limited medium capacity, ...
Dominic Meier, Yvonne Anne Pignolet, Stefan Schmid...