SYBIL-PROOF ID-TO-LOCATOR MAPPING IN ONE HOP

作     者：Hengkui Wu Meixia Duan Yaping Hu Siyun Bao 

作者单位：Science and Technology on Electronic Test & Measurement Laboratory41st Research Institute of CETC North China University of Water Resources and Electric Power 

会议名称：《2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems》

会议日期：2012年

学科分类：0839[工学-网络空间安全] 08[工学] 

基　　金：supported in part by Science and Technology Foundation of State Key Laboratory under Contract No. 9140C120202120C12052 

关 键 词：Locator/ID separation ID-to-locator mapping Scalability Sybil attack 

摘      要：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.