检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张洪泽 洪征 周胜利[2] 冯文博 ZHANG Hongze;HONG Zheng;ZHOU Shengli;FENG Wenbo(Institute of Command and Control Engineering,Army Engineering University of PLA,Nanjing 210000,China;Department of Computer and Information Technology,Zhejiang Police College,Hangzhou 310000,China)
机构地区:[1]中国人民解放军陆军工程大学指挥控制工程学院,南京210000 [2]浙江警察学院计算机与信息技术系,杭州310000
出 处:《计算机工程与应用》2020年第4期82-91,共10页Computer Engineering and Applications
基 金:国家重点研发计划(No.2017YFB0802900)
摘 要:针对现有的协议模糊测试技术存在报文重复交互、输入盲目等问题,提出一种基于协议状态迁移遍历的模糊测试优化方法。该方法将协议状态迁移遍历问题转化为中国邮路问题,求解遍历所有协议状态迁移的最短路径,并依据该最短路径对各个状态迁移进行测试。在测试过程中,通过分析协议实体在执行测试用例后的响应报文,动态调整后续的报文输入,进而避免无效交互。同时利用UIO序列判断协议实体状态是否发生异常迁移,及时检测协议逻辑漏洞。实验结果表明,该模糊测试优化方法可以显著提高测试效率与漏洞挖掘能力。There are many problems such as repetitive message interaction,blind input and so on in the current protocol fuzzing techniques.This paper presents a fuzzing method based on protocol state migration traversal.The method transforms protocol state migration traversal into a Chinese postman problem,and obtains the shortest path traversing all protocol state transitions.The method then tests each state transition according to the shortest path.In the process of fuzzing,message input is dynamically adjusted through analyzing the response message of protocol entity so as to avoid invalid interaction.In addition,the UIO sequence is used to determine whether the protocol entity state is abnormally migrated or not in order to detect the protocol logic vulnerability in time.Experimental results show that the fuzzing optimization method can significantly improve the fuzzing efficiency and the vulnerability mining ability.
关 键 词:模糊测试 协议状态机 协议状态迁移 中国邮路问题 UIO序列
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.102