Skip to Main Content
In this paper, we present a novel Internet-scale service directory based on the CHORD distributed hash table data structure. Our directory allows the distributed maintenance of a semantic index of services and aim at facilitating the creation of an open and fair service marketplace. In this competitive context, we explore a solution for secure routing in CHORD, which normally operate under the assumptions that all peers cooperate for the common good. Our modifications to the CHORD routing algorithm provide a probabilistic lower bound of secure message routing guarantee of secure message routing in competitive and rational environments such as a business market place. Through simulations, we show that the proposed algorithm provide a significant improvement over the standard CHORD algorithm.
Date of Conference: 10-12 Aug. 2005