天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

若干抗污染及竊聽的安全網(wǎng)絡編碼方案

發(fā)布時間:2018-07-02 22:53

  本文選題:網(wǎng)絡編碼 + 污染攻擊; 參考:《福建師范大學》2014年碩士論文


【摘要】:2000年,Ahlswede等人首次提出了網(wǎng)絡編碼概念,它與傳統(tǒng)單調(diào)的存儲—轉發(fā)路由工作方式有著明顯的區(qū)別。因為網(wǎng)絡編碼容許中間節(jié)點在轉發(fā)數(shù)據(jù)前先對來自上游不同鏈路上的消息數(shù)據(jù)進行編碼操作,所以,網(wǎng)絡編碼理論可使組播網(wǎng)絡達到“最大流最小割”定理規(guī)定的容量傳輸上界。此外,網(wǎng)絡編碼在降低節(jié)點能耗、改善網(wǎng)絡負載均衡和鞏固網(wǎng)絡魯棒性等方面均顯示出其優(yōu)越性。 隨著人們對網(wǎng)絡編碼的深入研究,它的安全性問題(信息竊聽和數(shù)據(jù)污染)越來越受到關注。目前,研究人員基于密碼學知識提出了許多抵抗信息竊聽和數(shù)據(jù)污染的安全網(wǎng)絡編碼方案。然而這些方案大多以犧牲系統(tǒng)性能作為代價,如增大了編碼的復雜度、降低了數(shù)據(jù)的傳輸速率以及增加了數(shù)據(jù)的冗余等,從而大大地降低了網(wǎng)絡的吞吐量。如何在有效地提升網(wǎng)絡的吞吐量和鏈路魯棒性的同時,又能確保網(wǎng)絡數(shù)據(jù)傳輸?shù)陌踩允蔷W(wǎng)絡編碼研究領域一個很有意義的課題。本論文主要針對網(wǎng)絡編碼存在的信息竊聽和數(shù)據(jù)污染兩大類安全問題作了一些工作。 本文首先對網(wǎng)絡編碼的基本概念和主要優(yōu)缺點,作了簡單地介紹,并簡要地概括了國內(nèi)外學者在網(wǎng)絡編碼安全性方面的研究成果及研究進展。其次,本文給出了一種抗竊聽和污染的網(wǎng)絡編碼方案。該方案利用節(jié)點的私鑰對數(shù)據(jù)進行加密以增強其安全性,有效地抵抗了竊聽攻擊;并且引入列表譯碼算法來抵抗污染攻擊。同時對該方案進行了數(shù)值分析,分析結果表明:信源編碼和信宿解碼兩方面的計算代價減小了,而且以接近1的概率達到弱安全要求。第三,本文提出了一種基于數(shù)字簽名的網(wǎng)絡編碼(SCH NC)方案,新方案不僅能夠解決污染攻擊問題,而且能有效地確定出污染攻擊源的位置,從而降低污染攻擊對網(wǎng)絡造成的影響。最后,本文通過引入快速的并行CRC校驗碼和消息時間戳的設計理念,給出了一種基于CRC校驗碼的防污染網(wǎng)絡編碼方案。從該方案的安全性方面和效率方面進行分析表明:網(wǎng)絡編碼、并行逆序CRC檢驗碼和消息時間戳三者的結合可以有效地抵抗污染攻擊和重放攻擊,并且大大地降低節(jié)點的計算代價,提高了網(wǎng)絡的吞吐量。
[Abstract]:In 2000, Ahlswede et al put forward the concept of network coding for the first time. Because network coding allows intermediate nodes to encode message data from different upstream links before forwarding data, Network coding theory can make multicast network reach the upper bound of capacity transmission stipulated by "maximum flow minimum cut" theorem. In addition, network coding has shown its advantages in reducing node energy consumption, improving network load balance and consolidating network robustness. With the deep research of network coding, its security (information eavesdropping and data pollution) has been paid more and more attention. At present, many secure network coding schemes are proposed based on cryptography knowledge to resist information eavesdropping and data pollution. However, most of these schemes are at the expense of system performance, such as increasing the complexity of coding, reducing the data transmission rate and increasing the data redundancy, thus greatly reducing the throughput of the network. How to improve the network throughput and link robustness while ensuring the security of network data transmission is a significant topic in the field of network coding research. In this paper, we focus on two kinds of security problems, information eavesdropping and data pollution, which exist in network coding. In this paper, the basic concepts, main advantages and disadvantages of network coding are briefly introduced, and the research results and progress in network coding security of domestic and foreign scholars are briefly summarized. Secondly, a network coding scheme against eavesdropping and pollution is presented. The scheme uses the private key of the node to encrypt the data to enhance its security, and effectively resists the eavesdropping attack, and introduces a list decoding algorithm to resist the pollution attack. At the same time, numerical analysis of the scheme is carried out. The results show that the computational cost of source coding and sink decoding is reduced, and the probability of close to 1 reaches the requirement of weak security. Thirdly, a digital signature based network coding (Sch NC) scheme is proposed. The new scheme can not only solve the problem of pollution attack, but also effectively determine the location of the source of pollution attack, thus reducing the impact of pollution attack on the network. Finally, by introducing the design idea of parallel CRC code and message timestamp, this paper presents a scheme of anti-pollution network coding based on CRC code. The analysis of the security and efficiency of the scheme shows that the combination of network coding, parallel inverse CRC check code and message timestamp can effectively resist the pollution attack and replay attack. And greatly reduces the node computation cost, improves the network throughput.
【學位授予單位】:福建師范大學
【學位級別】:碩士
【學位授予年份】:2014
【分類號】:TP393.08

【參考文獻】

相關期刊論文 前10條

1 張玉潔;蔡英;李卓;;網(wǎng)絡編碼中抗污染攻擊研究[J];北京信息科技大學學報(自然科學版);2013年01期

2 于志軒;王彩芬;羅海;馮帆;;一種可確認身份的網(wǎng)絡編碼簽名方案[J];計算機工程與應用;2011年28期

3 劉外喜;余順爭;蔡君;;安全的網(wǎng)絡編碼所面臨的挑戰(zhàn)和對策[J];計算機科學;2011年06期

4 蔣銘勛;崔巍;;隨機線性網(wǎng)絡編碼污染數(shù)據(jù)的檢測分析[J];計算機工程;2010年24期

5 嚴鳴;汪衛(wèi);施伯樂;;無線傳感器網(wǎng)絡中關鍵節(jié)點的節(jié)能問題[J];計算機應用與軟件;2007年06期

6 梁海華;盤麗娜;趙秀蘭;李克清;;CRC查詢表及其并行矩陣生成方法[J];計算機科學;2012年S1期

7 牛淑芬;王彩芬;;多源線性網(wǎng)絡編碼的同態(tài)簽名算法[J];計算機工程;2012年02期

8 梁海華;盤麗娜;;快速CRC逆序校驗方法[J];計算機應用;2013年07期

9 周業(yè)軍;李暉;馬建峰;;一種防竊聽的隨機網(wǎng)絡編碼[J];西安電子科技大學學報;2009年04期

10 陶少國;黃佳慶;楊宗凱;喬文博;熊志強;;網(wǎng)絡編碼研究綜述[J];小型微型計算機系統(tǒng);2008年04期

,

本文編號:2091210

資料下載
論文發(fā)表

本文鏈接:http://sikaile.net/guanlilunwen/ydhl/2091210.html


Copyright(c)文論論文網(wǎng)All Rights Reserved | 網(wǎng)站地圖 |

版權申明:資料由用戶1584f***提供,本站僅收錄摘要或目錄,作者需要刪除請E-mail郵箱bigeng88@qq.com