WSN安全協(xié)議抗離線字典攻擊能力研究
發(fā)布時(shí)間：2018-10-20 10:17
【摘要】：隨著信息技術(shù)的高速發(fā)展,無(wú)線傳感器網(wǎng)絡(luò)應(yīng)用得到快速普及,涉及軍事、健康護(hù)理、智能家居、空間探索、城市交通以及機(jī)場(chǎng)、大型工業(yè)園區(qū)的安全監(jiān)測(cè)等領(lǐng)域。其中對(duì)于大多數(shù)的非商業(yè)應(yīng)用來(lái)說(shuō)安全問(wèn)題并非一個(gè)十分重要的問(wèn)題,比如環(huán)境監(jiān)測(cè)、森林防火等應(yīng)用。而對(duì)于商業(yè)應(yīng)用中的無(wú)線安防網(wǎng)絡(luò)或者是軍事應(yīng)用中的部署于敵控區(qū)的軍事監(jiān)控網(wǎng)絡(luò)等應(yīng)用而言,對(duì)于數(shù)據(jù)的采樣以及數(shù)據(jù)的傳輸過(guò)程,甚至傳感器節(jié)點(diǎn)的位置分布也都是不可以讓無(wú)關(guān)人員或是敵方人員掌握,此時(shí)安全問(wèn)題就變得尤為重要。本文主要從兩個(gè)方面來(lái)研究無(wú)線傳感器網(wǎng)絡(luò)的安全問(wèn)題：安全協(xié)議的抗離線字典攻擊能力和機(jī)密性。安全協(xié)議抗離線字典攻擊能力的研究主要要關(guān)注兩個(gè)問(wèn)題：一是安全協(xié)議具備抗離線字典攻擊能力的條件是什么；二是要考慮無(wú)線傳感器網(wǎng)絡(luò)的局限性,在抗離線字典攻擊能力不變的情況下如何降低資源的消耗。機(jī)密性論證我們是假定密鑰安全的情況下來(lái)展開(kāi)的。本文構(gòu)建基于applied pi演算的安全協(xié)議形式化模型,致力于借助邏輯嚴(yán)密的形式化方法論證傳感器網(wǎng)絡(luò)安全協(xié)議的抗字典攻擊能力和機(jī)密性情況。本文的主要研究?jī)?nèi)容如下：(1)安全協(xié)議抗離線字典攻擊能力論證。字典攻擊是一種針對(duì)密鑰的攻擊,在互聯(lián)網(wǎng)以及傳統(tǒng)無(wú)線網(wǎng)絡(luò)中較為常見(jiàn),而在無(wú)線傳感網(wǎng)絡(luò)中相關(guān)的研究比較少。并且由于受自身在能耗以及計(jì)算能力等方面的限制,傳感器網(wǎng)絡(luò)更容易受到攻擊,因此針對(duì)無(wú)線傳感器網(wǎng)絡(luò)字典攻擊問(wèn)題的研究是十分有必要的。本文從安全協(xié)議加密方案的安全屬性入手,以SNEP協(xié)議作為分析案例,借助applied pi演算中的靜態(tài)等價(jià)及觀察等價(jià)理論,分析論證不同強(qiáng)度的密鑰以及不同屬性的加密方案對(duì)安全協(xié)議抗離線字典攻擊能力的影響,進(jìn)而得到傳感器網(wǎng)絡(luò)安全協(xié)議具備抗離線字典攻擊能力的條件,最后給出加密方案安全屬性的確定方法。(2)機(jī)密性論證。機(jī)密性是無(wú)線傳感器網(wǎng)絡(luò)眾多安全需求中最為核心的一項(xiàng),網(wǎng)絡(luò)安全的重點(diǎn)通常首先就是要解決數(shù)據(jù)機(jī)密性問(wèn)題,安全協(xié)議的機(jī)密性直接決定了網(wǎng)絡(luò)中傳輸數(shù)據(jù)消息的安全性。本文基于applied pi演算構(gòu)建SNEP協(xié)議機(jī)密性論證模型,將協(xié)議分成協(xié)議進(jìn)程和用戶進(jìn)程兩部分來(lái)分析,將協(xié)議的機(jī)密性轉(zhuǎn)換為協(xié)議的執(zhí)行過(guò)程是否具備不可區(qū)分性,進(jìn)而用等價(jià)理論證明了協(xié)議的機(jī)密性情況。
[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.
【學(xué)位授予單位】：福州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：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.
【學(xué)位授予單位】：福州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP212.9;TN915.08
【相似文獻(xiàn)】
相關(guān)期刊論文 前7條
1 王春曉;張鵬;;一種新型抵御字典攻擊的方案[J];電腦知識(shí)與技術(shù);2010年01期
2 於時(shí)才;胡佳文;靳艷峰;;一種新型抵御字典攻擊的認(rèn)證方案[J];計(jì)算機(jī)工程與設(shè)計(jì);2007年08期
3 馬自堂;張魯國(guó);;基于口令的群密鑰分發(fā)協(xié)議的分析與改進(jìn)[J];微計(jì)算機(jī)信息;2006年27期
4 孫全富;山拜·達(dá)拉拜;李慶華;;WPA/WPA2協(xié)議安全性分析[J];信息安全與通信保密;2013年04期
5 李慧慧;;口令安全淺析[J];太原大學(xué)教育學(xué)院學(xué)報(bào);2009年01期
6 葉長(zhǎng)國(guó);;基于口令的抵抗字典攻擊的密鑰交換協(xié)議[J];泰山學(xué)院學(xué)報(bào);2012年06期
7 ;[J];;年期
相關(guān)重要報(bào)紙文章 前2條
1 重慶大學(xué)計(jì)算機(jī)學(xué)院 路遙;破解字典攻擊 揪出內(nèi)部黑客[N];中國(guó)計(jì)算機(jī)報(bào);2008年
2 ;毒來(lái)毒網(wǎng)新趨勢(shì)[N];計(jì)算機(jī)世界;2003年
相關(guān)碩士學(xué)位論文 前2條
1 項(xiàng)俊龍;WSN安全協(xié)議抗離線字典攻擊能力研究[D];福州大學(xué);2014年
2 鮑R，
本文編號(hào)：2282845
本文鏈接：http://www.wukwdryxk.cn/kejilunwen/wltx/2282845.html
最近更新
教材專著
