WSN安全协议抗离线字典攻击能力研究
发布时间：2018-10-20 10:17
【摘要】：随着信息技术的高速发展,无线传感器网络应用得到快速普及,涉及军事、健康护理、智能家居、空间探索、城市交通以及机场、大型工业园区的安全监测等领域。其中对于大多数的非商业应用来说安全问题并非一个十分重要的问题,比如环境监测、森林防火等应用。而对于商业应用中的无线安防网络或者是军事应用中的部署于敌控区的军事监控网络等应用而言,对于数据的采样以及数据的传输过程,甚至传感器节点的位置分布也都是不可以让无关人员或是敌方人员掌握,此时安全问题就变得尤为重要。本文主要从两个方面来研究无线传感器网络的安全问题：安全协议的抗离线字典攻击能力和机密性。安全协议抗离线字典攻击能力的研究主要要关注两个问题：一是安全协议具备抗离线字典攻击能力的条件是什么；二是要考虑无线传感器网络的局限性,在抗离线字典攻击能力不变的情况下如何降低资源的消耗。机密性论证我们是假定密钥安全的情况下来展开的。本文构建基于applied pi演算的安全协议形式化模型,致力于借助逻辑严密的形式化方法论证传感器网络安全协议的抗字典攻击能力和机密性情况。本文的主要研究内容如下：(1)安全协议抗离线字典攻击能力论证。字典攻击是一种针对密钥的攻击,在互联网以及传统无线网络中较为常见,而在无线传感网络中相关的研究比较少。并且由于受自身在能耗以及计算能力等方面的限制,传感器网络更容易受到攻击,因此针对无线传感器网络字典攻击问题的研究是十分有必要的。本文从安全协议加密方案的安全属性入手,以SNEP协议作为分析案例,借助applied pi演算中的静态等价及观察等价理论,分析论证不同强度的密钥以及不同属性的加密方案对安全协议抗离线字典攻击能力的影响,进而得到传感器网络安全协议具备抗离线字典攻击能力的条件,最后给出加密方案安全属性的确定方法。(2)机密性论证。机密性是无线传感器网络众多安全需求中最为核心的一项,网络安全的重点通常首先就是要解决数据机密性问题,安全协议的机密性直接决定了网络中传输数据消息的安全性。本文基于applied pi演算构建SNEP协议机密性论证模型,将协议分成协议进程和用户进程两部分来分析,将协议的机密性转换为协议的执行过程是否具备不可区分性,进而用等价理论证明了协议的机密性情况。
[Abstract]:With the rapid development of information technology, wireless sensor network (WSN) applications have been rapidly popularized, involving military, health care, smart home, space exploration, urban transportation, airport, large-scale industrial park security monitoring and other fields. Safety is not a very important problem for most non-commercial applications, such as environmental monitoring, forest fire prevention and other applications. For applications such as wireless security networks in commercial applications or military surveillance networks deployed in enemy control areas in military applications, for data sampling and data transmission, Even the location distribution of sensor nodes can not be controlled by irrelevant or enemy personnel, so the security problem becomes more and more important. This paper mainly studies the security of wireless sensor networks from two aspects: the ability of resisting offline dictionary attacks and the confidentiality of security protocols. The research on the ability of security protocols to resist off-line dictionary attacks is mainly concerned with two problems: first, what are the conditions for security protocols to have the ability to resist offline dictionary attacks; secondly, the limitations of wireless sensor networks should be considered. How to reduce the consumption of resources when the ability to resist offline dictionary attacks remains unchanged. The confidentiality argument is conducted on the assumption that the key is secure. In this paper, a formal model of security protocol based on applied pi calculus is constructed, which is devoted to prove the ability of resisting dictionary attack and confidentiality of sensor network security protocol by means of logical formal method. The main contents of this paper are as follows: (1) the ability of security protocol to resist offline dictionary attacks is demonstrated. Dictionary attack is a key attack, which is more common in the Internet and traditional wireless networks, but there is less research on it in wireless sensor networks. Since sensor networks are more vulnerable to attack due to their limitations in energy consumption and computing power, it is necessary to study dictionary attacks in wireless sensor networks. This paper starts with the security attribute of the security protocol encryption scheme, takes the SNEP protocol as an analysis case, and makes use of the static equivalence and observational equivalence theory in applied pi calculus. This paper analyzes and demonstrates the influence of different key strength and encryption scheme of different attributes on the ability of security protocol to resist off-line dictionary attack, and then obtains the condition that the security protocol of sensor network has the ability to resist off-line dictionary attack. Finally, the method of determining the security attribute of encryption scheme is given. (2) confidentiality proof. Confidentiality is the core of many security requirements in wireless sensor networks. The focus of network security is usually to solve the problem of data confidentiality. The confidentiality of security protocols directly determines the security of the transmission of data messages in the network. Based on the applied pi calculus, this paper constructs the SNEP protocol confidentiality demonstration model, divides the protocol into two parts: the protocol process and the user process, and converts the confidentiality of the protocol into whether the protocol execution process is indistinguishable. Furthermore, the confidentiality of the protocol is proved by equivalent theory.
【学位授予单位】：福州大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN915.08
[Abstract]:With the rapid development of information technology, wireless sensor network (WSN) applications have been rapidly popularized, involving military, health care, smart home, space exploration, urban transportation, airport, large-scale industrial park security monitoring and other fields. Safety is not a very important problem for most non-commercial applications, such as environmental monitoring, forest fire prevention and other applications. For applications such as wireless security networks in commercial applications or military surveillance networks deployed in enemy control areas in military applications, for data sampling and data transmission, Even the location distribution of sensor nodes can not be controlled by irrelevant or enemy personnel, so the security problem becomes more and more important. This paper mainly studies the security of wireless sensor networks from two aspects: the ability of resisting offline dictionary attacks and the confidentiality of security protocols. The research on the ability of security protocols to resist off-line dictionary attacks is mainly concerned with two problems: first, what are the conditions for security protocols to have the ability to resist offline dictionary attacks; secondly, the limitations of wireless sensor networks should be considered. How to reduce the consumption of resources when the ability to resist offline dictionary attacks remains unchanged. The confidentiality argument is conducted on the assumption that the key is secure. In this paper, a formal model of security protocol based on applied pi calculus is constructed, which is devoted to prove the ability of resisting dictionary attack and confidentiality of sensor network security protocol by means of logical formal method. The main contents of this paper are as follows: (1) the ability of security protocol to resist offline dictionary attacks is demonstrated. Dictionary attack is a key attack, which is more common in the Internet and traditional wireless networks, but there is less research on it in wireless sensor networks. Since sensor networks are more vulnerable to attack due to their limitations in energy consumption and computing power, it is necessary to study dictionary attacks in wireless sensor networks. This paper starts with the security attribute of the security protocol encryption scheme, takes the SNEP protocol as an analysis case, and makes use of the static equivalence and observational equivalence theory in applied pi calculus. This paper analyzes and demonstrates the influence of different key strength and encryption scheme of different attributes on the ability of security protocol to resist off-line dictionary attack, and then obtains the condition that the security protocol of sensor network has the ability to resist off-line dictionary attack. Finally, the method of determining the security attribute of encryption scheme is given. (2) confidentiality proof. Confidentiality is the core of many security requirements in wireless sensor networks. The focus of network security is usually to solve the problem of data confidentiality. The confidentiality of security protocols directly determines the security of the transmission of data messages in the network. Based on the applied pi calculus, this paper constructs the SNEP protocol confidentiality demonstration model, divides the protocol into two parts: the protocol process and the user process, and converts the confidentiality of the protocol into whether the protocol execution process is indistinguishable. Furthermore, the confidentiality of the protocol is proved by equivalent theory.
【学位授予单位】：福州大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN915.08
【相似文献】
相关期刊论文 前7条
1 王春晓;张鹏;;一种新型抵御字典攻击的方案[J];电脑知识与技术;2010年01期
2 於时才;胡佳文;靳艳峰;;一种新型抵御字典攻击的认证方案[J];计算机工程与设计;2007年08期
3 马自堂;张鲁国;;基于口令的群密钥分发协议的分析与改进[J];微计算机信息;2006年27期
4 孙全富;山拜·达拉拜;李庆华;;WPA/WPA2协议安全性分析[J];信息安全与通信保密;2013年04期
5 李慧慧;;口令安全浅析[J];太原大学教育学院学报;2009年01期
6 叶长国;;基于口令的抵抗字典攻击的密钥交换协议[J];泰山学院学报;2012年06期
7 ;[J];;年期
相关重要报纸文章 前2条
1 重庆大学计算机学院 路遥;破解字典攻击 揪出内部黑客[N];中国计算机报;2008年
2 ;毒来毒网新趋势[N];计算机世界;2003年
相关硕士学位论文 前2条
1 项俊龙;WSN安全协议抗离线字典攻击能力研究[D];福州大学;2014年
2 鲍R，
本文编号：2282845
本文链接：https://www.wllwen.com/kejilunwen/wltx/2282845.html
