A randomized protocol for signing contracts
Communications of the ACM
How to simultaneously exchange secrets by general assumptions
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Fair exchange with a semi-trusted third party (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Escrow services and incentives in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Secure Group Barter: Multi-party Fair Exchange with Semi-Trusted Neutral Parties
FC '98 Proceedings of the Second International Conference on Financial Cryptography
An Efficient Non-repudiation Protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
A fair non-repudiation protocol
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
PPay: micropayments for peer-to-peer systems
Proceedings of the 10th ACM conference on Computer and communications security
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Faithfulness in internet algorithms
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Free Riding on Gnutella Revisited: The Bell Tolls?
IEEE Distributed Systems Online
Influences on cooperation in BitTorrent communities
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
EquiCast: scalable multicast with selfish users
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
WhoPay: A Scalable and Anonymous Payment System for Peer-to-Peer Environments
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Maintaining high bandwidth under dynamic network conditions
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Scrivener: providing incentives in cooperative content distribution systems
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Proof of service in a hybrid p2p environment
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Bittorrent is an auction: analyzing and improving bittorrent's incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
A Comparison of Bilateral and Multilateral Exchanges for Peer-Assisted Content Distribution
Network Control and Optimization
Peer-assisted content distribution with prices
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
TrInc: small trusted hardware for large distributed systems
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Antfarm: efficient content distribution with managed swarms
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Symbiotic relationships in internet routing overlays
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
FairTorrent: bringing fairness to peer-to-peer systems
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Architecture and incentive design of integrated cellular and disruption tolerant networks
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Robust and efficient incentives for cooperative content distribution
IEEE/ACM Transactions on Networking (TON)
Cooperation via contracts: stability and algorithms
INFOCOM'10 Proceedings of the 29th conference on Information communications
ARBOR: hang together rather than hang separately in 802.11 wifi networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Resisting free-riding behavior in BitTorrent
Future Generation Computer Systems
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Prices are right: managing resources and incentives in peer-assisted content distribution
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Collusion-resilient credit-based reputations for peer-to-peer content distribution
Proceedings of the 2010 Workshop on Economics of Networks, Systems, and Computation
BiCo: Network operator-friendly P2P traffic control through bilateral cooperation with peers
Computer Networks: The International Journal of Computer and Telecommunications Networking
A content propagation metric for efficient content distribution
Proceedings of the ACM SIGCOMM 2011 conference
Collusion in peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bilateral and multilateral exchanges for peer-assisted content distribution
IEEE/ACM Transactions on Networking (TON)
Peer-assisted network operator-friendly P2P traffic control technique
Proceedings of the 7th International Conference on Network and Services Management
Reliable client accounting for P2P-infrastructure hybrids
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
International Journal of Communication Networks and Distributed Systems
P2P as a CDN: A new service model for file sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking
COINS: COalitions and INcentiveS for effective Peer-to-Peer downloads
Journal of Network and Computer Applications
FairTorrent: a deficit-based distributed algorithm to ensure fairness in peer-to-peer systems
IEEE/ACM Transactions on Networking (TON)
Content availability and bundling in swarming systems
IEEE/ACM Transactions on Networking (TON)
Peer-assisted content distribution in Akamai netsession
Proceedings of the 2013 conference on Internet measurement conference
| Hi-index | 0.00 |
Content distribution via the Internet is becoming increasingly popular. To be cost-effective, commercial content providers are considering the use of peer-to-peer (P2P) protocols such as BitTorrent to save on bandwidth costs and to handle peak demands. However, when an online content provider uses a P2P protocol, it faces a crucial issue: how to incentivize its clients to upload to their peers. This paper presents Dandelion, a system designed to address this issue in the case of paid content distribution. Unlike previous solutions, most notably BitTorrent, Dandelion provides robust (provably non-manipulable) incentives for clients to upload to others. In addition, unlike systems with tit-for-tat-based incentives, a client is motivated to upload to its peers even if the peers do not have content that interests the client. A client that honestly uploads to its peers is rewarded with credit, which can be redeemed for various types of rewards, such as discounts on paid content. In designing Dandelion, we trade scalability for the ability to provide robust incentives. The evaluation of our prototype system on PlanetLab demonstrates the viability of our approach. A Dandelion server that runs on commodity hardware with a moderate access link is capable of supporting up to a few thousand clients. These clients can download content at rates comparable to those of BitTorrent clients.