A Scalable Anonymity Scheme Based on DHT Distributed Inquiry

Two key factors in the design of anonymity schemes are the scalability and the security of the relay node selection. In this paper, a scalable, secure anonymity scheme based on DHT inquiry mechanism is presented. Unlike the most existing schemes, every relay node´s routing information (RRI) is stored as normal data in DHT overlay. The routing information can be inquired just with corresponding relay node´s Relay ID (RID).All RID is maintained by SA to fill a dynamic range. So, user only needs to get the range of RID to select relay nodes, which is a datum with constant size. Such a mechanism significantly improve the scalability of scheme. Furthermore, RID assigned by SA also provides a more stable and provable relationship between relay nodes, which can be used to help validation of RRI storage. With this innovation, security measures are introduced. The framework of the scheme, key technical details and security analysis are described in this paper. In addition, simulation experiments are conducted to validate the effectiveness of this scheme.