本文選題：零向量 + 抗污染攻擊　； 參考：《蘇州大學(xué)》2014年碩士論文

【摘要】：網(wǎng)絡(luò)編碼允許結(jié)點對數(shù)據(jù)包進行編碼操作。相較于傳統(tǒng)存儲轉(zhuǎn)發(fā)機制，網(wǎng)絡(luò)編碼在吞吐量、數(shù)據(jù)機密性、數(shù)據(jù)流的不可追蹤性、魯棒性等方面有顯著優(yōu)勢。因此該思想引起了學(xué)界的廣泛關(guān)注。 雖然引入網(wǎng)絡(luò)編碼能帶來很多好處，但如果網(wǎng)絡(luò)中有惡意結(jié)點發(fā)起污染攻擊，那么，整個系統(tǒng)的各方面性能將會大大下降。Kehdi等人提出了基于零向量的方案。該方案能很好地抵抗污染攻擊，而且還有諸如分布式特性好、檢測計算開銷小、系統(tǒng)簡單易實現(xiàn)等優(yōu)點。然而，該零向量方案中，如果惡意結(jié)點獲得了源結(jié)點分發(fā)的零向量所構(gòu)成的零向量空間，那么它們就可以輕易攻破整個系統(tǒng)，亦即方案的安全性較低。 針對上述問題，我們提出了全零向量空間的概念。該空間的特點是，沒有污染包能通過它的檢測。如果在上述基于零向量的方案中，源結(jié)點分發(fā)的零向量空間能構(gòu)成全零向量空間，那么就可以有效提高方案的安全性。但這會給系統(tǒng)帶來很大的開銷。 為了減少零向量帶來的開銷，我們推廣了零向量的概念，提出了部分位置檢測的思想，構(gòu)造了長度比原來的零向量短的零向量。我們證明短零向量存在全零向量空間，并且證明在構(gòu)成全零向量空間時，相比于原來的零向量，短零向量帶來的開銷會減少。隨后，我們在前面的研究基礎(chǔ)上給出了短的零向量存在全零向量空間的充分條件。 接著，我們設(shè)計了基于短零向量的抗污染攻擊網(wǎng)絡(luò)編碼方案，并通過嚴(yán)格的證明分析了方案的安全性，通過數(shù)值分析綜合考慮方案的各種性能，確定了該方案中各個參數(shù)的取值。在這些參數(shù)設(shè)定下，短零向量方案的安全性高且計算開銷、通信開銷小，，是一種高效的抗污染攻擊網(wǎng)絡(luò)編碼方案。 由于短零向量之間的檢測位置不一定相同，使得在上述方案中源結(jié)點只能以逐個秘密分發(fā)的方式向網(wǎng)絡(luò)中的各結(jié)點分發(fā)短零向量。這在網(wǎng)絡(luò)規(guī)模很大或動態(tài)性很強時會大大增加源結(jié)點的負(fù)載，影響方案的分布式性能。為了解決該問題，我們構(gòu)造了壓縮短零向量，使零向量仍能以網(wǎng)絡(luò)編碼的形式傳播。在此基礎(chǔ)上，我們對壓縮短零向量進行了優(yōu)化，構(gòu)造了新型壓縮短零向量。我們證明壓縮短零向量和新型壓縮短零向量都存在全零向量空間，并且證明在構(gòu)成全零向量空間時，相比于原來的零向量，這兩種零向量帶來的開銷都會減少。 然后，我們設(shè)計了基于新型壓縮短零向量的方案。在該方案中，新型壓縮短零向量以網(wǎng)絡(luò)編碼的形式傳播。這使該方案保持了原有方案的分布式性能，解決了短零向量方案分布式性能差的問題。接著，我們通過嚴(yán)格的證明分析了新型壓縮短零向量方案的安全性，證明當(dāng)參數(shù)取值滿足一定條件時，該方案的計算開銷、通信開銷、安全性都會優(yōu)于原零向量方案。最后，我們通過實驗數(shù)據(jù)說明該方案相對于同態(tài)哈希方案和原有的零向量方案的優(yōu)勢，是一種高效的抗污染攻擊網(wǎng)絡(luò)編碼方案。
[Abstract]:Network coding allows nodes to encode packets. Compared with traditional storage and forward mechanism, network coding has significant advantages in throughput, data confidentiality, non traceability of data flow, robustness and so on. Therefore, this idea has aroused widespread concern in the academic field.
Although the introduction of network coding can bring a lot of benefits, if there are malicious nodes in the network to launch a pollution attack, the performance of the whole system will be greatly reduced by.Kehdi et al. And the scheme based on zero vector is proposed. The scheme can resist pollution attacks well, and also such as good distributed characteristics and small detection computing overhead. However, in the zero vector scheme, if the malicious node gets the zero vector space formed by the zero vector of the source node distribution, then they can easily break the whole system, that is, the security of the scheme is low.
In order to solve the above problem, we propose the concept of all zero vector space. The characteristic of this space is that no pollution packet can be detected by it. If the zero vector space distributed by the source node can constitute all zero vector space in the zero vector based scheme, the security of the scheme can be improved effectively. But this will bring the system very much. Big expenses.
In order to reduce the overhead caused by zero vector, we generalized the concept of zero vector, proposed the idea of partial position detection, constructed a zero vector with shorter length than the original zero vector. We prove that the short zero vector exists all zero vector space, and proves that when the whole zero vector space is formed, the short zero vector is compared to the original zero vector and the short zero vector. Then we will give sufficient conditions for the existence of all zero vector spaces of short zero vectors on the basis of previous studies.
Then, we design an anti pollution attack network coding scheme based on short zero vector, and analyze the security of the scheme through strict proof. Through the comprehensive consideration of various performance of the scheme through numerical analysis, we determine the value of each parameter in the scheme. Under these parameters, the short zero vector scheme has high security and computing overhead. Communication overhead is small, and it is an efficient network coding scheme against pollution attacks.
Because the detection location between short and zero vectors is not necessarily the same, the source nodes in the proposed scheme can only distribute short and zero vectors to each node in the network by one by one distribution. This will greatly increase the load of the source nodes and the distributed performance of the scheme when the network is large or dynamic. In order to solve this problem, We construct the compressed short zero vector, so that the zero vector can still be propagated in the form of network coding. On this basis, we optimize the compressed short zero vector and construct a new compressed short zero vector. We prove that both the compressed short zero vector and the new compressed short zero vector have all zero vector spaces, and prove that the zero vector space is made up of all zero vector space. Compared with the original zero vectors, the cost of these two zeros will be reduced.
Then, we design a scheme based on the new compression short zero vector. In this scheme, the new compressed short zero vector is propagated in the form of network coding. This makes the scheme keep the distributed performance of the original scheme and solve the problem of the poor distributed performance of the short zero vector scheme. Then, we analyze the new compression by strict proof. The security of the short zero vector scheme proves that the calculation overhead, the communication overhead and the security of the scheme are superior to the original zero vector scheme when the parameter value satisfies certain conditions. Finally, we show the superiority of the scheme compared with the homomorphic hash scheme and the original zero direction scheme through experimental data. It is an efficient anti pollution attack network. Collaterals coding scheme.
【學(xué)位授予單位】：蘇州大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.08

【參考文獻】

相關(guān)期刊論文 前3條

1 張興堂;王巍;劉莉;;基于FPGA與CPCI總線的通用時統(tǒng)模塊設(shè)計[J];工業(yè)控制計算機;2009年02期

2 徐鵬;崔國華;付才;湯學(xué)明;;DL假設(shè)下一種更高效的第三方權(quán)力受約束的IBE方案[J];中國科學(xué):信息科學(xué);2010年02期

3 趙亞群;F_q上矩陣秩的概率分布及其漸近性質(zhì)[J];信息工程學(xué)院學(xué)報;1996年04期

本文編號：2112669