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.
Locator/ID separation ID-to-locator mapping Scalability Sybil attack
Hengkui Wu Meixia Duan Yaping Hu Siyun Bao
Science and Technology on Electronic Test & Measurement Laboratory,41st Research Institute of CETC,Q North China University of Water Resources and Electric Power,Zhengzhou 450011,China
国际会议
杭州
英文
745-748
2012-10-30(万方平台首次上网日期,不代表论文的发表时间)