Marco Milanesio - Dipartimento di Informatica Università di Torino Corporate communication
Date: October 13th 2010 Location: Eurecom - Eurecom
Structured Peer-to-Peer (P2P) Systems provide many services and competitive features, such as resilient distributed storage, high scalability and efficiency, and good resistance against random node failures. For this reason, a P2P based middleware is largely suitable for a vast variety of distributed applications, and its features comes by means of partitioning the ownership of a set of keys among participating nodes in a balanced and consistent way. The structured topology, the routing strategy and the keys assignment, independently from the number of nodes in the system, prevent many malicious behaviors and many attacks quite common in other distributed environments. However, some issues remain unsolved or partially mitigated by the adoption of some ad hoc features. On one side, the flat space of indexes prevents complex queries in these system, as all messages are routed by means of the exact match of the identifiers. On the other side, it is always up to the application layer to concern about possible malicious behavior of the single peers, as one of the assumption made in building a DHT routing algorithm is that peers always contribute to the system in an efficient way. In this work we analyze the overall process of building distributed applications in a secure way, providing a general walkthrough for the development of a secure routing infrastructure allowing complex queries in the system.