检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:乔延臣 云晓春[1,2,3] 庹宇鹏[2,3] 张永铮[2,3] QIAO Yan-chen YUN Xiao-chunl, TUO Yu-peng ZHANG Yong-zheng(Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China Graduate School, Chinese Academy of Sciences, Beijing 100039, China Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China)
机构地区:[1]中国科学院计算技术研究所,北京100080 [2]中国科学院研究生院,北京100039 [3]中国科学院信息工程研究所,北京100093
出 处:《通信学报》2016年第11期104-113,共10页Journal on Communications
基 金:国家自然科学基金资助项目(No.61303261);国家高技术研究发展计划("863"计划)基金资助项目(No.2013AA014703;No.2012AA012803);国家242信息安全计划基金资助项目(No.2014A094);中国科学院战略性科技先导专项基金资助项目(No.XDA06030200)~~
摘 要:提出了一种新颖的复用代码精确快速溯源方法。该方法以函数为单位,基于simhash与倒排索引技术,能在海量代码中快速溯源相似函数。首先基于simhash利用海量样本构建具有三级倒排索引结构的代码库。对于待溯源函数,依据函数中代码块的simhash值快速发现相似代码块,继而倒排索引潜在相似函数,依据代码块跳转关系精确判定是否相似,并溯源至所在样本。实验结果表明,该方法在保证高准确率与召回率的前提下,基于代码库能快速识别样本中的编译器插入函数与复用函数。A novel method for fast and accurately tracing reused code was proposed. Based on simhash and inverted index, the method can fast trace similar functions in massive code. First of all, a code database with three-level inverted index structures was constructed. For the function to be traced, similar code blocks could be found quickly according to simhash value of the code block in the function code. Then the potential similar functions could be fast traced using inverted index. Finally, really similar functions could be identified by comparing jump relationships of similar code blocks. Further, malware samples containing similar functions could be traced. The experimental results show that the method can quickly identify the functions inserted by compilers and the reused functions based on the code database under the premise of high accuracy and recall rate.
关 键 词:网络安全 复用代码 快速溯源 同源判定 恶意代码
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.129.89.50