Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
ACM Transactions on Computer Systems (TOCS)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
SETI@home: an experiment in public-resource computing
Communications of the ACM
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
IEEE Transactions on Parallel and Distributed Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Consensus in byzantine asynchronous systems
Journal of Discrete Algorithms
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
EquiCast: scalable multicast with selfish users
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Low complexity Byzantine-resilient consensus
Distributed Computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
It's on me! the benefit of altruism in BAR environment
DISC'10 Proceedings of the 24th international conference on Distributed computing
Asynchrony and collusion in the n-party BAR transfer problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
We introduce the N-party BAR transfer problem that consists in reliably transferring arbitrarily large data from a set of N producers to a set of N consumers in the BAR model, i.e., in the presence of Byzantine, Altruistic, and Rational participants. The problem considers the existence of a trusted observer that gathers evidence to testify that the producers and consumers have participated in the transfer. We present an algorithm that solves the problem for N≥2f+1, where f is the maximum number of Byzantine processes in each of the producer and consumer sets. We do not impose limits on the number of Rational participants, although they can deviate from the algorithm to improve their utility. We show that our algorithm provides a Nash equilibrium.