检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵自强 李强[2] 郭涛 Zhao Ziqiang;Li Qiang;Guo Tao(School of Electronic Information,Anhui Jianzhu University,Hefei 230022,China;Southwest Jiaotong University Shenzhen Research Institute,Xi′an 710000,China)
机构地区:[1]安徽建筑大学电子信息学院,安徽合肥230022 [2]西南交通大学深圳研究院,陕西西安710000
出 处:《网络安全与数据治理》2024年第2期16-22,共7页CYBER SECURITY AND DATA GOVERNANCE
摘 要:现有存储型网络隐蔽信道的研究主要根据不同协议中不同字段来隐藏信息。在众多协议中,例如TCP、UDP协议,对其研究较多,而OSFP使用广泛却在国内研究较少。针对OSPF协议下的Hello报文进行分析可以构建网络隐蔽信道的字段。从所有可能字段中选择Authentication、Router Dead Interval和Neighbor三个字段分别使用随机值模式、值调制模型和序列模式进行构建三种隐蔽信道,利用微协议技术优化信道,并将三种隐蔽信道组合成一个传输速率更高的隐蔽信道模型。经过验证,该模型具有一定的可行性和隐蔽性,可为存储型网络隐蔽信道构建技术提供一定的理论支持和技术支撑。The existing network covert channels in the storage category mainly rely on the characteristics of different fields in different protocols.Although many protocols such as TCP and UDP have been extensively studied,OSFP is widely used but less researched in China.This paper analyzes the Hello message under the OSPF protocol to construct the fields of network covert channels.Three covert channels are constructed using three fields selected from all possible fields,namely Authentication,RouterDeadInterval,and Neighbor,respectively,by adopting random value pattern,value modulation model,and sequence pattern.Channel optimization is achieved by applying microprotocol technology.Finally,the three covert channels are combined into a higher transmission rate covert channel model.Verification shows that this model has certain feasibility and concealment,can provide theoretical support and technical support for the construction of storage-type network covert channels.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.142.243.141