基于洗牌策略的Sybil攻击防御

Resisting Sybil Attacks with Cards-Shuffling Scheme

洗牌策略从理论上解决了分布式哈希表(DHT)的Sybil攻击问题.为克服敌手作弊,引入受信节点构成分布式认证系统,由受信节点对新加入节点进行认证,保证节点签名和ID不能伪造;同时引入记录洗牌加入过程的票据来判定节点合法性,杜绝了敌手积累过期ID.由于保存票据的数量决定了论文提出算法的应用效果,通过理论分析和仿真实验证实设计的算法需要保存的票据数量不大,保证了算法的可行性.

The Cards-Shuffling scheme solves the S ybil attack in distributed hash table （DHT） theoretically. To overcome cheats of the enemy, a distributed authentication system which constructed by trusted nodes is proposed. The joining nodes are authenticated by the trusted nodes to ensure that the sign and identifiers of the nodes can not be fabricated. Tickets recording the joining process of Cards-Shuffling scheme are also introduced to verify the nodes so that the accumulation of expired identifiers is impossible. The performance of the algorithm proposed by the paper is determined by the number of tickets to be stored. Both the analysis and simulation confirrn that there won＇ t be a great number of tickets to be stored, which guarantees the feasibility of the algorithm.