How to construct random functions
Journal of the ACM (JACM)
Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior
Proceedings of the 2nd ACM conference on Electronic commerce
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Ciphers with Arbitrary Finite Domains
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
An integrated experimental environment for distributed systems and networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Moderately hard, memory-bound functions
ACM Transactions on Internet Technology (TOIT)
Avoiding ballot stuffing in eBay-like reputation systems
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Enabling contribution awareness in an overlay broadcasting system
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Democratizing content publication with coral
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
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
Making p2p accountable without losing privacy
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Pors: proofs of retrievability for large files
Proceedings of the 14th ACM conference on Computer and communications security
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
One hop reputations for peer to peer file sharing workloads
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Scalable and efficient provable data possession
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Compact Proofs of Retrievability
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Peer-assisted content distribution with prices
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Design and deployment of a hybrid CDN-P2P system for live video streaming: experiences with LiveSky
MM '09 Proceedings of the 17th ACM international conference on Multimedia
Proof of service in a hybrid p2p environment
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Low-cost client puzzles based on modular exponentiation
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
DCast: sustaining collaboration in overlay multicast despite rational collusion
Proceedings of the 2012 ACM conference on Computer and communications security
Towards self-repairing replication-based storage systems using untrusted clouds
Proceedings of the third ACM conference on Data and application security and privacy
What's a little collusion between friends?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Many peer-assisted content-distribution systems reward a peer based on the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowledge, an open problem; e.g., a group of colluding attackers can earn rewards by claiming to have served content to one another, when they have not. We propose a puzzle mechanism to make contribution-aware peer-assisted content distribution robust to such collusion. Our construction ties solving the puzzle to possession of specific content and, by issuing puzzle challenges simultaneously to all parties claiming to have that content, our mechanism prevents one content-holder from solving many others' puzzles. We prove (in the random oracle model) the security of our scheme, describe our integration of bandwidth puzzles into a media streaming system, and demonstrate the resulting attack resilience via simulations.