Sciweavers

Share
INFOCOM
2011
IEEE
7 years 6 months ago
Capacity of byzantine agreement with finite link capacity
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...
Guanfeng Liang, Nitin H. Vaidya
ICDCN
2011
Springer
7 years 6 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
CORR
2007
Springer
121views Education» more  CORR 2007»
8 years 3 months ago
Lower Bounds on Implementing Robust and Resilient Mediators
We provide new and tight lower bounds on the ability of players to implement equilibria using cheap talk, that is, just allowing communication among the players. One of our main r...
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
CORR
2006
Springer
114views Education» more  CORR 2006»
8 years 3 months ago
A Byzantine Fault Tolerant Distributed Commit Protocol
In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over untrusted networks. The traditional two-phase commit protocol is enh...
Wenbing Zhao
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
8 years 4 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
PODC
2010
ACM
8 years 5 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
8 years 7 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
SPAA
2010
ACM
8 years 8 months ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
PODC
2003
ACM
8 years 8 months ago
An asynchronous protocol for distributed computation of RSA inverses and its applications
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
Christian Cachin
WDAG
2004
Springer
105views Algorithms» more  WDAG 2004»
8 years 8 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...
books