The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Limited reputation sharing in P2P systems
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
An Empirical Study of Collusion Behavior in the Maze P2P File-Sharing System
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Bittorrent is an auction: analyzing and improving bittorrent's incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Rationality and traffic attraction: incentives for honest path announcements in bgp
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Antfarm: efficient content distribution with managed swarms
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Contracts: practical contribution incentives for P2P live streaming
NSDI'10 Proceedings of the 7th USENIX conference on Networked 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
Collusion-resilient credit-based reputations for peer-to-peer content distribution
Proceedings of the 2010 Workshop on Economics of Networks, Systems, and Computation
It's on me! the benefit of altruism in BAR environment
DISC'10 Proceedings of the 24th international conference on Distributed computing
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
An intensive survey of fair non-repudiation protocols
Computer Communications
DCast: sustaining collaboration in overlay multicast despite rational collusion
Proceedings of the 2012 ACM conference on Computer and communications security
Reasoning with MAD distributed systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
This paper proposes a fundamentally different approach to addressing the challenge posed by colluding nodes to the sustainability of cooperative services. Departing from previous work that tries to address the threat by disincentivizing collusion or by modeling colluding nodes as faulty, this paper describes two new notions of equilibrium, k-indistinguishability and k-stability, that allow coalitions to leverage their associations without harming the stability of the service.