A security pattern for data integrity in P2P systems

ABSTRACT

Peer-To-Peer-systems (P2P) introduced new methods to distribute large amounts of data to end users. To increase the distribution speed resources from all participating network nodes, the peers, are used, and therefore the workload on own resources decreases. To utilize all peers large data is split into small pieces, so called chunks, and these chunks are distributed among peers therefore making each chunk available on different peers. To identify and find chunks in P2P-systems hash algorithms are used, and each peer is responsible for a specific range of the hash's keyspace and all chunks that fall within this keyspace.

With data stored on multiple peers new security risks in terms of confidentiality, integrity, and availability arise. Our security pattern targeted specifically for P2P-systems helps system designers to identify possible threats and show appropriate countermeasures. We show how secure hash algorithms can guarantee the integrity of the distributed data even though chunks are sent to, received from, and stored by multiple, possible untrustworthy, peers.

References

1. M. Bishop. Introduction to Computer Security. Addison-Wesley Professional, 2004.
2. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Designing Privacy Enhancing Technologies, volume 2009 of LNCS, pages 46--66. Springer-Verlag, 2001.
3. F. Cornelli, E. Damiani, S. D. Capitani, S. Paraboschi, and P. Samarati. Choosing reputable servents in a p2p network. In In Proceedings of the 11th World Wide Web Conference, pages 376--386, 2002.
4. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In SOSP '01: Proceedings of the eighteenth ACM symposium on Operating systems principles, pages 202--215, New York, NY, USA, 2001. ACM.
5. P. Maymounkov and D. Mazières. Kademlia: A peer-to-peer information system based on the xor metric. In IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 53--65, London, UK, 2002. Springer-Verlag.
6. B. S. P. Hoffman. Attacks on cryptographic hashes in internet protocols. RFC 4270, November 2005.
7. J. Pouwelse, P. Garbacki, D. Epema, and H. Sips. The bittorrent p2p file-sharing system: Measurements and analysis. In In Proceedings of Peer-to-Peer Systems IV, volume 3640 of LNCS, pages 205--216. Springer-Verlag, 2005.
8. M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36: 335--348, 1989.
9. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pages 161--172, New York, NY, USA, October 2001.
10. S. Ratnasamy, P. Francis, S. Shenker, R. Karp, and M. Handley. A scalable content-addressable network. In In Proceedings of ACM SIGCOMM, pages 161--172, 2001.
11. E. Rescorla. SSL and TLS: designing and building secure systems. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2001.
12. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329--350, Nov. 2001.
13. B. Schneier. Applied cryptography (2nd ed.): protocols, algorithms, and source code in C. John Wiley & Sons, Inc., New York, USA, 1995.
14. C. Steel. Applied J2ee Security Patterns: Architectural Patterns & Best Practices. Prentice Hall PTR, Upper Saddle River, NJ, USA, 2005.
15. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. Computer Communication Review, 31(4): 149--160, Oct. 2001.
16. X. Wang, X. Lai, D. Feng, H. Chen, and X. Yu. Cryptanalysis of the hash functions md4 and ripemd. In In Proceedings of Eurocrypt '05, volume 3494 of LNCS, pages 1--18. Springer-Verlag, 2005.
17. B. Y. Zhao, J. Kubiatowicz, A. D. Joseph, B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, University of California at Berkeley, 2001.

Index Terms

• Computer systems organization

  • Architectures

    • Distributed architectures

• Security and privacy

• Social and professional topics

  • Computing / technology policy

    • Computer crime

• Software and its engineering

  • Software notations and tools

    • General programming languages

      • Language features

        • Patterns

  • Software organization and properties

    • Software system structures

      • Distributed systems organizing principles

        • Client-server architectures

      • Software architectures