Sybil-proof ID-to-locator mapping in one hop

In this paper, we propose SS-MAP, a scalable and Sybil-proof locator/ID mapping scheme for the future Internet. SS-MAP uses a near-optimal distributed hash table (DHT) to map identifiers onto locators in one hop with reasonable maintenance overhead, which are O(log n) hops in regular DHT-based mechanisms (n is the number of mapping servers). This is the first work to discuss sybil attacks in identifier (ID)-to-locator mapping, where a malicious mapping server creates numerous fake identities, called sybil identifiers, to influence the system. We present a decentralized admission control system via client puzzles to protect the mapping system from sybil attacks. We show the scalability and security of SS-MAP both analytically and experimentally.