Open AccessHomomorphic Subspace MAC Scheme for Secure Network Coding
Author(s) -
Liu Guangjun,
Wang Xiao
Publication year - 2013
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.13.0212.0166
Subject(s) - computer science , homomorphic encryption , linear network coding , collusion , cryptography , computer network , subspace topology , computer security , coding (social sciences) , theoretical computer science , encryption , mathematics , statistics , artificial intelligence , network packet , economics , microeconomics
Existing symmetric cryptography‐based solutions against pollution attacks for network coding systems suffer various drawbacks, such as highly complicated key distribution and vulnerable security against collusion. This letter presents a novel homomorphic subspace message authentication code (MAC) scheme that can thwart pollution attacks in an efficient way. The basic idea is to exploit the combination of the symmetric cryptography and linear subspace properties of network coding. The proposed scheme can tolerate the compromise of up to r−1 intermediate nodes when r source keys are used. Compared to previous MAC solutions, less secret keys are needed for the source and only one secret key is distributed to each intermediate node.