Sciweavers

219 search results - page 20 / 44
» Byzantine Quorum Systems
Sort
View
SRDS
1999
IEEE
14 years 2 months ago
Information Dissemination in Partitionable Mobile Ad Hoc Networks
Ad-hoc wireless networks have no wired component, and may have unpredictable mobility pattern. Such networks can get partitioned and reconnected several times. One possible approa...
Goutham Karumanchi, Srinivasan Muralidharan, Ravi ...
OPODIS
2007
13 years 11 months ago
Byzantine Consensus with Few Synchronous Links
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
Moumen Hamouma, Achour Mostéfaoui, Gilles T...
PODC
2010
ACM
13 years 11 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
SPAA
2010
ACM
14 years 2 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 ...
CHARME
2003
Springer
129views Hardware» more  CHARME 2003»
14 years 3 months ago
On the Correctness of an Intrusion-Tolerant Group Communication Protocol
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
Mohamed Layouni, Jozef Hooman, Sofiène Taha...