Comment on “An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding”

Author

Chen Li ; Le Chen ; Rongxing Lu ; Hui Li

Author_Institution

State Key Lab. of Integrated Service Network, Xidian Univ., Xi´an, China

Volume

64

Issue

3

fYear

2015

fDate

March 1 2015

Firstpage

882

Lastpage

883

Abstract

Quite recently, Cheng and Jiang [1] designed an efficient homomorphic message authentication code (MAC) scheme for authentication in network coding, and claimed that the newly proposed scheme can achieve much higher security level with a formal security proof. However, in this comment, we will point out there exists a design flaw in their proposed scheme, leading to an inherent vulnerability, and also show an inaccuracy in their formal security proof. We hope that by identifying the design flaw, similar mistakes can be avoided in future design of homomorphic MAC authentication for network coding.

Keywords

message authentication; network coding; telecommunication security; design flaw identification; efficient homomorphic MAC scheme; formal security proof; inherent vulnerability; message authentication code; network coding; small key size; Authentication; Educational institutions; Encoding; Equations; Forgery; Network coding; Homomorphic message authentication code; network coding; pollution attack;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.2015.2389800

Filename

7031996