检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周安民 钟毅 左政[2] 张磊 ZHOU Anmin;ZHONG Yi;ZUO Zheng;ZHANG Lei(College of Cybersecurity,Sichuan University,Chengdu 610065,China;College of Electronice and Information Engineering,Sichuan University,Chengdu 610065,China)
机构地区:[1]四川大学网络空间安全学院,成都610065 [2]四川大学电子信息学院,成都610065
出 处:《哈尔滨工业大学学报》2020年第5期66-74,共9页Journal of Harbin Institute of Technology
基 金:国家重点研发计划资金(2017YFB0802900)。
摘 要:公有区块链网络(如比特币、以太坊等)具有匿名、难以被关闭的特点,被用于僵尸网络的通信模型研究中,但现有研究中的方法存在网络扩展代价高和回传通道易被溯源的问题.针对上述问题,本文提出D-BitBot,一种基于比特币网络双向通信的点对点(P2P)僵尸网络模型构建方法.该方法使用比特币测试网络作为回传信道,可有效降低数据回收的成本和网络扩展的代价,且能提高回传信道抗溯源的能力;为解决传统僵尸网络上线方式的单点故障缺陷,本文提出一种基于比特币区块链的节点上线机制;另外,为抵御路由表节点注入攻击和僵尸网络节点爬取,本文提出一种基于T地址加盐哈希排序的节点列表交换算法.实验结果表明,在仿真环境中的D-BitBot上线率达到100%,且具有良好的鲁棒性;在节点请求和节点爬取测试中,本文所提出的算法能有效抵御路由表节点注入攻击和降低现有爬取算法的节点发现率.最后,本文基于3个不同的层面提出可能的抵御方式,并针对本文采用信道的鲁棒性对进行相应的分析和论述.Botnets choose blockehain networks(such as Bitcoin and Ethereum)as the communication channel for their command-and-control(C&C)mechanism because blockehain networks are anonymous and hard to shut down.Recent research foeuses on this mechanism,but the research methods have such defects that the scalability is restricted,and the upstream channel is vulnerable to existing tracing techniques.To solve these problems,D BitBot,a peer-to-peer(P2P)-based duplex botnet model which utilizes the Bitcoin testnet as the upstream channel is proposed in this paper.The C&C channel used in this model is hard to trace and reduces the cost of data recovery and network scalability.To avoid single point of failure in traditional botnet bootstrap procedure,a Bitcoin blockchain based bootstrap mechanism is presented.Further,to defend against direct routing table poisoning and P2P botnet crawling,a novel peer list exchange algorithm based on the sorted hash values of IP addresses and random salt values is proposed.According to the result of P2P simulation,D-BitBot provided robust network conectivity with an online rate of 100%。In the node request and node crawling algorithm,the proposed algorithm was effective against direct routing table poisoning and reduced the node detection rate of the current crawling algorithm.Lastly,possible countermneasures and the robustness of the proposed C&C channel were discussed at the end of this paper.
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117