Securing P2P Storage with a Self-organizing Payment Scheme

  • Nouha Oualha
  • Yves Roudier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6514)


This paper describes how to establish trust for P2P storage using a payment-based scheme. This scheme relies on the monitoring of storage peers on a regular basis. The verification operations allow assessing peer behavior and eventually estimating their subsequent remuneration or punishment. The periodic verification operations are used to enforce the fair exchange of a payment against effective cooperative peer behavior. Payments are periodically provided to peers based on the verification results. Only cooperative peers are paid by data owners with the help of intermediates in the P2P network, thus accommodating peer churn. Moreover, our payment scheme does not require any centralized trusted authority to appropriately realize a large-scale system. Simulations in this paper evaluate the capability of the payment scheme to work as a sieve to filter out non cooperative peers.


P2P storage cooperation Storage reliability payment based scheme 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Buttyán, L., Hubaux, J.-P.: Nuglets: a virtual currency to stimulate cooperation in self-organized ad hoc networks. Technical report, EPFL (2001)Google Scholar
  2. 2.
    Weyland, A., Staub, T., Braun, T.: Comparison of Incentive-based Cooperation Strategies for Hybrid Networks. In: Braun, T., Carle, G., Koucheryavy, Y., Tsaoussidis, V. (eds.) WWIC 2005. LNCS, vol. 3510, pp. 169–180. Springer, Heidelberg (2005) ISBN: 3-540-25899-XCrossRefGoogle Scholar
  3. 3.
    Akamai technologies, Inc.,
  4. 4.
    Oualha, N., Nen, M., Roudier, Y.: A Security Protocol for Self-Organizing Data Storage. In: 23rd International Information Security Conference (SEC 2008), Milan, Italy (September 2008)Google Scholar
  5. 5.
    Oualha, N., Nen, M., Roudier, Y.: A Security Protocol for Self-Organizing Data Storage. Technical Report N RR-08-208, EURECOM (January 2008) (extended version)Google Scholar
  6. 6.
    Vogt, H., Pagnia, H., Gärtner, F.C.: Using Smart Cards for Fair Exchange. In: Fiege, L., Mühl, G., Wilhelm, U.G. (eds.) WELCOM 2001. LNCS, vol. 2232, pp. 101–113. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: Proceeding of the IEEE Symposium on Security and Privacy, Oakland, CA, USA, May 3-6, pp. 86–99 (1998)Google Scholar
  8. 8.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of SIGCOMM, San Diego, CA, August 27-31 (2001)Google Scholar
  9. 9.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Liu, H. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of SIGCOMM, San Diego, CA, August 27-31 (2001)Google Scholar
  11. 11.
    Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB//CSD-01-1141, University of California, Berkeley (April 2000)Google Scholar
  12. 12.
    Sit, E., Morris, R.: Security Considerations for P2P Distributed Hash Tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 261. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. In: Symposium on Operating Systems and Implementation, OSDI 2002, Boston, MA (December 2002)Google Scholar
  14. 14.
    Vishnumurthy, V., Chandrakumar, S., Sirer, E.G.: KARMA: A Secure Economic Framework for P2P Resource Sharing. In: Proceedings of the Workshop on the Economics of Peer-to-Peer Systems, Berkeley, California (June 2003)Google Scholar
  15. 15.
    Ray, I., Ray, I.: Fair Exchange in E-Commerce. ACM SIGEcomm Exchange 3(2), 9–17 (Spring 2002)CrossRefGoogle Scholar
  16. 16.
    Desmedt, Y.G., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)Google Scholar
  17. 17.
    Stutzbach, D., Rejaie, R.: Towards a Better Understanding of Churn in Peer-to-Peer Networks. Technical Report CIS-TR-04-06, University of Oregon (November 2004)Google Scholar
  18. 18.
    Lillibridge, M., Elnikety, S., Birrell, A., Burrows, M., Isard, M.: A Cooperative Internet Backup Scheme. In: Proceedings of the 2003 Usenix Annual Technical Conference (General Track), San Antonio, Texas, pp. 29–41 (June 2003)Google Scholar
  19. 19.
  20. 20.
    Rivest, R.L., Shamir, A.: Payword and micromint: two simple micropayment schemes. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol. 1189. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  21. 21.
    Glassman, S., Manasse, M., Abadi, M., Gauthier, P., Sobalvarro, P.: The millicent protocol for inexpensive electronic commerce. In: Proceeding of WWW4 (1995)Google Scholar
  22. 22.
    Yang, B., Garcia-Molina, H.: PPay: Micropayments for Peer-to-Peer Systems. In: ACM Conference on Computer and Communications Security (CCS 2003), Washington, DC, USA (October 2003)Google Scholar
  23. 23.
    Rivest, R.L.: Electronic lottery tickets as micropayments. In: Luby, M., Rolim, J.D.P., Serna, M. (eds.) FC 1997. LNCS, vol. 1318, pp. 307–314. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  24. 24.
    Bhagwan, R., Tati, K., Cheng, Y.-C., Savage, S., Voelker, G.M.: TotalRecall: System Support for Automated Availability Management. In: ACM/USENIX NSDI (2004)Google Scholar
  25. 25.
    Oualha, N., Roudier, Y.: Reputation and Audits for Self-Organizing Storage. In: The 1st Workshop on Security in Opportunistic and SOCial Networks (SOSOC 2008), Istanbul, Turkey (September 2008)Google Scholar
  26. 26.
    Brighten Godfrey, P., Shenker, S., Stoica, I.: Minimizing churn in distributed systems. ACM SIGCOMM CCR 36(4) (2006)Google Scholar
  27. 27.
    Deswarte, Y., Quisquater, J.-J., Sadane, A.: Remote Integrity Checking. In: Proceedings of Sixth Working Conference on Integrity and Internal Control in Information Systems, IICIS (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Nouha Oualha
    • 1
  • Yves Roudier
    • 2
  1. 1.Telecom ParisTechParisFrance
  2. 2.EURECOMSophia AntipolisFrance

Personalised recommendations