Ieee Infocom 2009 2009
DOI: 10.1109/infcom.2009.5061945
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Scheme for Securing XOR Network Coding against Pollution Attacks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
109
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 122 publications
(109 citation statements)
references
References 15 publications
0
109
0
Order By: Relevance
“…Cryptographic schemes with homomorphic hash function (or homomorphic signature functions) were also proposed in Gkantsidis and Rodriguez [40], Yu et al [142]. Homomorphic hash functions are suitable for linear network coding because the hash value h( p) of a linearly coded output packet p = N i=1 c i x i is given in terms of those of input packets x i , i.e.,…”
Section: Detection Of Pollution Attacksmentioning
confidence: 99%
See 1 more Smart Citation
“…Cryptographic schemes with homomorphic hash function (or homomorphic signature functions) were also proposed in Gkantsidis and Rodriguez [40], Yu et al [142]. Homomorphic hash functions are suitable for linear network coding because the hash value h( p) of a linearly coded output packet p = N i=1 c i x i is given in terms of those of input packets x i , i.e.,…”
Section: Detection Of Pollution Attacksmentioning
confidence: 99%
“…For example, the scheme in Yu et al [142] assumes that the source node calculates a signature h(x i ) (i = 1, 2, . .…”
Section: Detection Of Pollution Attacksmentioning
confidence: 99%
“…In each iteration (lines 8-26), we download exactly one new equation (line 9), which becomes the equation that is used as the testing equation in attack detection (line 12). The algorithm takes every possible subset C ′ of C, such that |C ′ | = τ is not greater than τ max (lines [13][14][15], and uses the equations in C ′ to replace τ equations in S in all possible ways (lines [16][17][18]. After each replacement, the attack detection mechanism is executed on the resulting set S ′ of equations using e as the testing equation (line 19).…”
Section: Algorithm 2 1) Descriptionmentioning
confidence: 99%
“…The only exception is a recent scheme [6] which achieves constant-size public key at the cost of using expensive bilinear maps. The scheme presented in [48] avoids using homomorphic signatures or hashes all together by relying solely on much more efficient symmetric key encryptions, however, the drawback is the significantly larger bandwidth overhead.…”
Section: Related Workmentioning
confidence: 99%