2010
DOI: 10.1016/j.comnet.2009.08.006
|View full text |Cite
|
Sign up to set email alerts
|

An efficient dynamic-identity based signature scheme for secure network coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
35
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 30 publications
(35 citation statements)
references
References 18 publications
0
35
0
Order By: Relevance
“…We can apply the method in [25] to the proposed scheme additionally. Then, we can verify the coded data without decoding into the CRL at the forwarders.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We can apply the method in [25] to the proposed scheme additionally. Then, we can verify the coded data without decoding into the CRL at the forwarders.…”
Section: Resultsmentioning
confidence: 99%
“…Node can mix corrupted pieces easily, and the false pieces are difficult to detect until they were decoded. However, NC can verify coded data at the forwarder since the forwarder can re-encode the received coded data with holding the corresponding the CRL pieces and their signature [25]. Thus, NC can ensure pieces authenticity and integrity.…”
Section: Mpb-ec Schemementioning
confidence: 99%
“…However, Yun et al demonstrate that Yu et al's scheme does not satisfy the required homomorphic property in [33]. Some schemes (e.g., the homomorphic hashing scheme, the MAC-based scheme, the dynamic-identity based signature scheme, and the efficient subspace authentication [27], [28], [29], [30]) have been proposed against pollution attacks for network coding and erasure codes. Y.…”
Section: H Comparisons With Other Schemesmentioning
confidence: 99%
“…For instance, erasure codes (e.g., Reed-Solomon codes [10]), fountain codes (e.g., LT codes [7]), growth codes [5], and priority linear codes [11] have been proposed in the recent years. In addition, some schemes are proposed to provide the integrity guarantee for network coding or erasure codes [26], [27], [29], [30], but the data maintenance issue is not addressed in these schemes. There are also some secure data storage schemes which include the secure data access approach with polynomial-key management, the adaptive polynomialbased data storage scheme, etc.…”
Section: Introductionmentioning
confidence: 99%
“…The recipients use the public key known to all the nodes to check the integrity of the packet. However, these schemes are based on expensive paring operations [5]- [7] or exponentiation operations over a large field [8], which makes these schemes not fast enough for online communication. …”
mentioning
confidence: 99%