2021
DOI: 10.1080/09540091.2020.1841109
|View full text |Cite
|
Sign up to set email alerts
|

A novel approach for anti-pollution attacks in network coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…Pollution attacks [10] aims to add malicious packets in the network which can be used later to start other types of attacks. There are two types of pollution attacks:…”
Section: Adversary Modelmentioning
confidence: 99%
“…Pollution attacks [10] aims to add malicious packets in the network which can be used later to start other types of attacks. There are two types of pollution attacks:…”
Section: Adversary Modelmentioning
confidence: 99%
“…As a result, even with sufficient packets, the destination node may fail to recover the original data, squandering network resources. Existing countermeasures against pollution attacks generally fall into two categories: information-theoretic methods [12][13][14] and cryptographic methods [15][16][17]. Information-theoretic methods introduce redundancy to recover from malicious faults but merely tolerate pollution attacks passively at the destination.…”
Section: Introductionmentioning
confidence: 99%
“…Network coding has the merits of high transmission efficiency, fast speed, strong robustness, and good stability, but it is vulnerable to the pollution attacks in the data transmission process. In recent years, the researchers have proposed a series of network-coding signature schemes [2][3][4][5][6] to solve the network coding contamination, where the schemes in [4,5] effectively solved the replay attacks by using the time stamps; the certificateless network-coding homomorphism signature [6] is designed by using the homomorphic hash function; it can resist the replay attacks with forgery attacks at the same time and has lower computational overhead with the communication cost.…”
Section: Introductionmentioning
confidence: 99%