Please use this identifier to cite or link to this item:
|Title:||DCast: Sustaining collaboration in overlay multicast despite rational collusion|
|Authors:||Yu, H. |
|Keywords:||Algorithmic mechanism design|
|Citation:||Yu, H.,Gibbons, P.B.,Shi, C. (2012). DCast: Sustaining collaboration in overlay multicast despite rational collusion. Proceedings of the ACM Conference on Computer and Communications Security : 567-580. ScholarBank@NUS Repository. https://doi.org/10.1145/2382196.2382256|
|Abstract:||A key challenge in large-scale collaborative distributed systems is to properly incentivize the rational/selfish users so that they will properly collaborate. Within such a context, this paper focuses on designing incentive mechanisms for overlay multicast systems. A key limitation shared by existing proposals on the problem is that they are no longer able to provide proper incentives and thus will collapse when rational users collude or launch sybil attacks. This work explicitly aims to properly sustain collaboration despite collusion and sybil attacks by rational users. To this end, we propose a new decentralized DCast multicast protocol that uses a novel mechanism with debt-links and circulating debts. We formally prove that the protocol offers a novel concept of safety-net guarantee: A user running the protocol will always obtain a reasonably good utility despite the deviation of any number of rational users that potentially collude or launch sybil attacks. Our prototyping as well as simulation demonstrates the feasibility and safety-net guarantee of our design in practice. Copyright © 2012 ACM.|
|Source Title:||Proceedings of the ACM Conference on Computer and Communications Security|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 10, 2018
checked on Nov 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.