基于Merkle难题的P2P网络匿名认证方案  

A Merkle-Based Anonymous Authentication Scheme in P2P Networks

作　　者：程春玲[1] 高炳贞[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003

出　　处：《计算机技术与发展》2009年第11期147-150,154,共5页Computer Technology and Development

基　　金：国家自然科学基金(60573141);国家"863"计划项目(2008AA701202)

摘　　要：现有的认证方案大多采用超级节点或者引入CA认证中心进行节点间认证,破坏了P2P网络分布式特点;此外,认证过程一般使用节点的真实ID,不能满足P2P网络匿名性的需求。针对以上问题,文中提出一种结合Merkle难题和改进的SAKA算法的节点间匿名认证方案MBAA(Merkle-based Anonymous Authentication)。该方案使用Merkle难题产生和安全传输SAKA算法所必需的对等节点间的初始共享密钥,并采用基于单向散列函数认证的SAKA算法,实现了P2P网络中节点之间的分布式匿名认证。理论分析表明,MBAA可以有效抵御中间人攻击、重放攻击和密码猜测攻击,是一种安全有效的匿名认证方案。Most present authentication mechanisms are based on super peers or CA （certificate authority） for peers＇ certification, which destroy the characteristics of distributed P2P network. Moreover, previous studies try to adopt peers＇ real ID in the process of certifica- tion, which can not meet the demand of anonymity in P2P networks. Propose a distributed anonymous authentication policy called MBAA to cope with those problems. MBAA employs Merkle＇s puzzle and improved SAKA algorithm. Firstly, Merkle＇s puzzle is applied to generate and transmit peers＇ initial shared keys, which is necessary in SAKA algorithm. Then hash function is used for authentication by SA- KA algorithm. In this way, MBAA realizes distributed anonymous authentication between peers in P2P networks. The theoretical analysis shows that MBAA is safe and effective and it can resist man- in - the- middle- attack, replay attack and guess key attack.

关 键 词：P2P Merkle难题 SAKA算法 匿名性 认证 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]