Proof of service in a hybrid p2p environment

Authors:
Jun Li;Xun Kang
Affiliations:
Department of Computer and Information Science, University of Oregon;Department of Computer and Information Science, University of Oregon
Venue:
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 5
Cited 3

Some guidelines for non-repudiation protocols

ACM SIGCOMM Computer Communication Review
A Lightweight, Robust P2P System to Handle Flash Crowds

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Formal Analysis of a Non-Repudiation Protocol

CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
An intensive survey of fair non-repudiation protocols

Computer Communications

Dandelion: cooperative content distribution with robust incentives

ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
An Incentive-Based System for Information Providers over Peer-to-Peer Mobile Ad-Hoc Networks

MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles

ICISS '09 Proceedings of the 5th International Conference on Information Systems Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a hybrid peer-to-peer environment, clients can either directly download data from their server, or share data with each other. In order to create incentives for clients to share data and decrease server load, an effective economy model is for the server to credit those provider clients who provide data to others and offer discounts to those recipient clients who download data from provider clients instead of the server. To realize this model, the proof of service between provider and recipient clients must be provided. We design and investigate three different schemes and compare them in terms of scalability, effectiveness, and cost. We emphasize the issues of lessening the number of proofs which must be provided, avoiding a heavy load on the server, and ensuring the proof for every piece of data served. Our study shows our enhanced public-key-based scheme to be the most effective.