Publication 2013 Issue No. 10 - Oct. Abstract - An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding
An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding
Oct. 2013 (vol. 62 no. 10)
pp. 2096-2100
 ASCII Text x Chi Cheng, Tao Jiang, "An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding," IEEE Transactions on Computers, vol. 62, no. 10, pp. 2096-2100, Oct., 2013.
 BibTex x @article{ 10.1109/TC.2012.135,author = {Chi Cheng and Tao Jiang},title = {An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding},journal ={IEEE Transactions on Computers},volume = {62},number = {10},issn = {0018-9340},year = {2013},pages = {2096-2100},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2012.135},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - An Efficient Homomorphic MAC with Small Key Size for Authentication in Network CodingIS - 10SN - 0018-9340SP2096EP2100EPD - 2096-2100A1 - Chi Cheng, A1 - Tao Jiang, PY - 2013KW - GamesKW - VectorsKW - EquationsKW - Network codingKW - AuthenticationKW - PollutionKW - homomorphic message authentication codeKW - Network codingKW - pollution attackVL - 62JA - IEEE Transactions on ComputersER -
Chi Cheng, Huazhong University of Science and Technology, Wuhan
Tao Jiang, Huazhong University of Science and Technology, Wuhan
Recently, homomorphic message authentication code (MAC) schemes have been proposed to resist against pollution attacks in network coding. However, existing methods face a common challenge: the generated MAC $(t)$ belongs to a small finite field $({\hbox{\rlap{I}\kern 2.0pt{\hbox{F}}}}_{q})$, which means that an adversary could attack by randomly guessing the value of $(t)$, and succeed with probability $(1/q)$. Since $(q)$ is a predetermined system parameter which is typically set as $(2^8)$, the resulted security $(1/256)$ could be unsatisfactory in practice. In this paper, we propose an efficient homomorphic MAC for authentication in network coding. The proposed method achieves a reliable security parameter $(1/q^l)$ using only one key, where $(l)$ could be chosen according to different security requirements. Compared with previous approaches that using multiple tags, the proposed homomorphic MAC has both low computation and communication overheads.
Index Terms:
Games,Vectors,Equations,Network coding,Authentication,Pollution,homomorphic message authentication code,Network coding,pollution attack
Citation:
Chi Cheng, Tao Jiang, "An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding," IEEE Transactions on Computers, vol. 62, no. 10, pp. 2096-2100, Oct. 2013, doi:10.1109/TC.2012.135