2015
DOI: 10.1155/2015/510251
|View full text |Cite
|
Sign up to set email alerts
|

Dual-Homomorphic Message Authentication Code Scheme for Network Coding-Enabled Wireless Sensor Networks

Abstract: Network coding has shown a considerable improvement in terms of capacity and robustness compared to traditional store-andforward transmission paradigm. However, since the intermediate nodes in network coding-enabled networks have the ability to change the packets en route, network coding-enabled networks are vulnerable to pollution attacks where a small number of polluted messages can corrupt bunches of legitimate messages. Recently, research effort has been put on schemes for protecting the transmitted messag… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 27 publications
(21 citation statements)
references
References 23 publications
0
21
0
Order By: Relevance
“…The proposed security scheme is closely comparable with [13] and Dual HMAC schemes [14], [20] which already are well known and secure. However, we provide an advantage over the computational and communication overhead of these schemes at the expense of a blockchain facilitated over the network.…”
Section: Performance Evaluationmentioning
confidence: 53%
See 1 more Smart Citation
“…The proposed security scheme is closely comparable with [13] and Dual HMAC schemes [14], [20] which already are well known and secure. However, we provide an advantage over the computational and communication overhead of these schemes at the expense of a blockchain facilitated over the network.…”
Section: Performance Evaluationmentioning
confidence: 53%
“…However this is again a part of the message and hence negligible comparatively to the total overhead. Even if we consider the same number of tags for the Dual HMAC scheme [20], it needs additional L tags to protect against the tag pollution attack making our scheme approximately L/(L + L ) times efficient in terms of communication overhead. Fig.…”
Section: B Communication Overheadmentioning
confidence: 99%
“…Additionally, the tags will be sent to the central unit via control channel which is independent from the communication channel between the devices. Comparing this scheme with other schemes secure against tag pollution attacks, we understand that for the same number of tags, our scheme produces a much lesser communication overhead compared to Dual HMAC [14] and MacSig [12]. Fig.…”
Section: Communication Overheadmentioning
confidence: 91%
“…MacSig [12] proposes the usage of a homomorphic signature over the MAC scheme to certify that the tags attached to the packets are corresponding to the packet itself. Dual HMAC and HMAC [13,14] try to reduce the computational and communicational overhead of MacSig using a novel key distribution model based on c cover free family. This also provide security against a situation in which a number of compromised nodes act together to pollute the network at a lower key storage overhead at intermediate nodes.…”
Section: Random Linear Network Coding and Pollution Attacksmentioning
confidence: 99%
“…Data integrity is required to prevent any polluted data packets from being transmitted further through the network. The research community proposed various integrity schemes [24,25,26,27,28,29,30,31,32,33,34] to solve this problem. However, the efficiency and effectiveness of the integrity schemes are closely related to the key management schemes which are responsible for the generation, distribution, use and update of the cryptographic keys used by the integrity schemes.…”
Section: Network Coding-enabled Networkmentioning
confidence: 99%