Sciweavers

4 search results - page 1 / 1
» On Byzantine Agreement over (2, 3)-Uniform Hypergraphs
Sort
View
WDAG
2004
Springer
105views Algorithms» more  WDAG 2004»
13 years 10 months ago
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
D. V. S. Ravikant, Muthuramakrishnan Venkitasubram...
ETRICS
2006
13 years 8 months ago
A P2P Content Authentication Protocol Based on Byzantine Agreement
One of the main advantages of peer-to-peer (P2P) systems is their capability to offer replicas of the same content at various locations. This allows to access contents even when so...
Esther Palomar, Juan M. Estévez-Tapiador, J...
PODC
2009
ACM
14 years 5 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
FOCS
2008
IEEE
13 years 11 months ago
Network Extractor Protocols
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerm...