Sciweavers

148 search results - page 14 / 30
» Self-stabilization of Byzantine Protocols
Sort
View
IJACT
2010
90views more  IJACT 2010»
13 years 4 months ago
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optima
: We study the interplay of network connectivity and the issues related to the `possibility', `feasibility' and `optimality' for unconditionally reliable message tra...
Arpita Patra, Ashish Choudhury, C. Pandu Rangan, K...
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
14 years 4 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
PODC
2009
ACM
14 years 10 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
SOSP
2005
ACM
14 years 6 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
USENIX
2008
14 years 4 days ago
Diverse Replication for Single-Machine Byzantine-Fault Tolerance
New single-machine environments are emerging from abundant computation available through multiple cores and secure virtualization. In this paper, we describe the research challeng...
Byung-Gon Chun, Petros Maniatis, Scott Shenker