A computationally efficient HMAC-based authentication scheme for network coding

Tandoh Lawrence, Fagen Li (), Ikram Ali, Charles R. Haruna, Michael Y. Kpiebaareh and Tandoh Christopher
Additional contact information
Tandoh Lawrence: University of Electronic Science and Technology of China
Fagen Li: University of Electronic Science and Technology of China
Ikram Ali: University of Electronic Science and Technology of China
Charles R. Haruna: University of Cape Coast
Michael Y. Kpiebaareh: University of Electronic Science and Technology of China
Tandoh Christopher: Wicrecend, Wicresoft

Telecommunication Systems: Modelling, Analysis, Design and Management, 2022, vol. 79, issue 1, No 5, 47-69

Abstract: Abstract One of the major security threats that plague network coding are pollution attacks. Therefore, the ability to authenticate the contents of received packets is a vital requirement of all network coding authentication schemes. One of the most famous cryptographic approaches used to mitigate data and tag pollution in network coding are homomorphic message authentication codes (HMACS). In this approach, authentication is achieved by appending one or more HMAC tag vectors and in some cases a homomorphic cryptographic signature to the packet payload. Two major concerns arise when designing authentication schemes for network coding. These are the costs associated with the communication and computational overheads. These two factors determine the efficiency and practicality of the scheme. Unfortunately, in most cases, lowering one of the costs results in an increase in the other. In this paper we propose an efficient data and tag pollution immune authentication scheme based on HMACs and a homomorphic cryptographic signature. In our evaluation of the performance of the proposed scheme we compared it with three other similar state of the art schemes. The result of our evaluation showed that the proposed scheme incurs a computational overhead that is up to 64–97% lower at the source and non-source nodes. The proposed scheme also fairs well with respect to communication overhead where it is only outperformed by one of the three schemes. This difference however is minute (one symbol) and is greatly outweighed by the proposed schemes lower computational overhead.

Keywords: Network coding; Pollution attack; Authentication; Computational overhead; Efficient (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-021-00842-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:telsys:v:79:y:2022:i:1:d:10.1007_s11235-021-00842-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-021-00842-6

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().