Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A Novel Homomorphic MAC Scheme for Authentication in Network Coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chi Cheng ; Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Tao Jiang

Recently, homomorphic message authentication code (MAC) schemes have been proposed to thwart pollution attacks in network coding. However, existing schemes adopt the inner product operation to construct the MAC, which could be broken with probability Pr=1/q, where the predetermined system parameter q is typically set as 28. Usually, the homomorphic MAC with a security parameter Pr=1/28 may not be sufficient in practice. In this letter, we propose a novel scheme and its key idea is to employ the trace function over a finite field to construct the homomorphic MAC. The proposed method could achieve a reliable security Pr=1/ql without increasing the field size or employing multiple keys, where l is a positive integer greater than or equal to 1.

Published in:

Communications Letters, IEEE  (Volume:15 ,  Issue: 11 )