一种基于决策树的比特币不可达节点发现方法  

A decision tree-based discovery method for Bitcoin unreachable nodes

作　　者：李锐光 朱佳伟[2] 吴阜东[3] 高家奇 徐大伟 祝烈煌 LI Ruiguang;ZHU Jiawei;WU Fudong;GAO Jiaqi;XU Dawei;ZHU Liehuang(School of Cyberspace Science and Technology,Beijing Institute of Technology,Beijing 100081,China;National Computer Network Emergency Response Technical Team Coordination Center of China,Beijing 100029,China;School of Cyber Security,Changchun University,Changchun 130022,China)

机构地区：[1]北京理工大学网络空间安全学院,北京100081 [2]国家计算机网络应急技术处理协调中心,北京100029 [3]长春大学网络安全学院,长春130022

出　　处：《北京航空航天大学学报》2024年第6期1861-1867,共7页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家重点研发计划(2020YFB1006100);国家自然科学基金(62106060)。

摘　　要：不可达节点是指比特币网络中不接收外部连接请求的网络工作节点,发现、验证均较为困难。现有研究大多集中于可达节点,而对不可达节点的研究较少。为此,提出一种基于决策树算法的不可达节点发现方法,可以从大量比特币地址中自动分类发现不可达节点。实验结果表明:所提方法在实验数据集上分类准确率为95.73%,召回率为91.97%;在真实数据上进行实测,并利用网络空间搜索引擎进行验证,所提方法实际分类准确率为53.75%,召回率约为76.86%。对实验中发现不可达节点的总量、地理分布、所属网络服务商等进行统计分析,为比特币监管工作提供有力技术支撑。Unreachable nodes refer to nodes that don't accept connection requests in the Bitcoin network,which are difficult to detect and verify.The existing studies mostly focused on the reachable nodes,but less on the unreachable nodes.A new approach is proposed to find the unreachable nodes based on a decision tree model,which can automatically classify unreachable nodes from a large numberof Bitcoin addresses.The results show that the proposed approach got an accuracy of 95.73%and a recall of 91.97%on the experimental dataset.The author applied the approach to the real dataset and verified it by the cyberspace search engines.The proposed approach’s accuracy was 53.75%and the recall was about 76.86%.The distribution of network providers,geographical areas,and the overall number of Unreachable nodes were discussed,which provided technical support for Bitcoin supervision.

关 键 词：比特币 不可达节点 可达节点 决策树 网络空间搜索引擎 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TN919[自动化与计算机技术—计算机科学与技术]