Escrow services and incentives in peer-to-peer networks

ABSTRACT

Distribution of content, such as music, remains one of the main drivers of P2P development. Subscription-based services are currently receiving a lot of attention from the content industry as a viable business model for P2P content distribution. One of the main problems that such services face is that users may choose to redistribute content outside the community of subscribers, thereby facilitating large-scale piracy. Digital Rights Management (DRM) systems typically employ tamper resistance techniques to control this risk. We propose a system architecture that uses economic incentives instead of tamper resistance to motivate users to keep the content within the subscription community. The key technical contribution we make is to integrate a P2P file sharing service with an escrow service that reliably "pays" the party that is serving up the content. The payment itself can be realized in a number of ways, using "actual" money or bonus points such as frequent flyer miles.Moreover, our architecture facilitates trust between two unacquainted parties by offloading risk to a trusted third party, which can acquire a revenue stream by assuming this risk. To implement the escrow service securely we use cryptographic techniques, such as encryption, hashing, and error correcting codes. Our system motivates users to serve up content of high quality and verifies that users only share legitimate content and not spam, viruses or content that is not part of the subscription. We thereby address other important security concerns in P2P systems and problems like the free-rider phenomenon.

REFERENCES

• 1: A.Adar and B.Huberman,Free Riding on Gnutella manuscript,2000.
• 2: N. Asokan , Matthias Schunter , Michael Waidner, Optimistic protocols for fair exchange, Proceedings of the 4th ACM conference on Computer and communications security, p.7-17, April 01-04, 1997, Zurich, Switzerland [doi>10.1145/266420.266426]
• 3: N.Asokan,V.Shoup and M.Waidner,Optimistic fair exchange of digital signatures EUROCRYPT '98,pp. 591-606.
• 4: Mihir Bellare , Ran Canetti , Hugo Krawczyk, Keying Hash Functions for Message Authentication, Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, p.1-15, August 18-22, 1996
• 5: Manuel Blum, How to exchange (secret) keys, ACM Transactions on Computer Systems (TOCS), v.1 n.2, p.175-193, May 1983 [doi>10.1145/357360.357368]
• 6: A.Bahreman and J.D.Tygar,Certi .ed electronic mail Proc.of NDSS 1994,pp.3-19.
• 7: Richard Cleve, Controlled gradual disclosure schemes for random bits and their applications, Proceedings on Advances in cryptology, p.573-588, July 1989, Santa Barbara, California, United States
• 8: Tom Coffey , Puneet Saidha, Non-repudiation with mandatory proof of receipt, ACM SIGCOMM Computer Communication Review, v.26 n.1, p.6-17, Jan. 1996 [doi>10.1145/232335.232338]
• 9: B.Cox J.D.Tygar and M.Sirbu,NetBill security and transaction protocol Proc.1st Usenix workshop on electronic commerce,pp.77-88,1995.
• 10: R.H.Deng,L.Gong,A.Lazar and W.Wang,Practical protocols for certi .ed electronic mail ,J.ofNetwork and Systems Management 4(3):279-297,1996.
• 11: Danny Dolev , Cynthia Dwork , Moni Naor, Nonmalleable Cryptography, SIAM Journal on Computing, v.30 n.2, p.391-437, 2000 [doi>10.1137/S0097539795291562]
• 12: Matthew K. Franklin , Michael K. Reiter, Fair exchange with a semi-trusted third party (extended abstract), Proceedings of the 4th ACM conference on Computer and communications security, p.1-5, April 01-04, 1997, Zurich, Switzerland [doi>10.1145/266420.266424]
• 13: Shafi Goldwasser , Leonid A. Levin, Fair Computation of General Functions in Presence of Immoral Majority, Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, p.77-93, August 11-15, 1990
• 14: Venkatesan Guruswami , Madhu Sudan, Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.28, November 08-11, 1998
• 15: Michael Luby, Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs, Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, p.171, October 08-10, 1998
• 16: M.Luby S.Micali and C.Racko .,How to simultaneously exchange a secret bit by .ipping a symmetrically-biased coin 25th FOCS,pp.11-21, 1984.
• 17: R.C.Merkle,A digital signature based on a conventional encryption function ,Crypto '89,pp. 428-446,Springer-Verlag,1990.
• 18: Paypal.com,http://www.paypal.com
• 19: V.Shoup,OAEP reconsidered manuscript,2000.
• 20: Jianying Zhou , Dieter Gollmann, Evidence and non-repudiation, Journal of Network and Computer Applications, v.20 n.3, p.267-281, July 1997 [doi>10.1006/jnca.1997.0056]

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.4 COMPUTERS AND SOCIETY
      K.4.4 Electronic Commerce
          Subjects: Payment schemes

Additional Classification:
  E. Data
  E.3 DATA ENCRYPTION
      Subjects: Public key cryptosystems

  K. Computing Milieux
  K.4 COMPUTERS AND SOCIETY
      K.4.1 Public Policy Issues
          Subjects: Intellectual property rights

General Terms:
Performance, Security, Theory