Cart (Loading....) | Create Account
Close category search window
 

Fast Message Authentication Code for Multiple Messages with Provable Security

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)
Vosoughi, A. ; Electr. & Comput. Eng. Dept., North Dakota State Univ., Fargo, ND, USA ; Katti, R.

In this paper we consider authentication of multiple messages m1, m2, ..., mL where each message mi consists of s bits. We propose a scheme for the computation of a message authentication code (MAC) tag t, of m1, m2, ..., mL that takes constant time (time that is independent of L) and has a tag length that is constant or independent of L. The verification time of the proposed scheme is also constant. Current schemes result in tag computation and verification times proportional to L and are hence less efficient than the proposed scheme. The proposed scheme uses a modification of division by an irreducible polynomial over GF(2) in order to compress the L messages. The compressed result is then input to a pseudorandom function Fk(.) to obtain a secure tag t. We prove the security of the proposed MAC scheme. The proposed scheme has applications in sensor networks where many messages having one tag can reduce the number of bits being transmitted by a sensor node, thereby reducing the power consumption at a sensor node. Another application is in multimedia authentication, where a large multimedia data file can be split up into smaller segments whose MAC tag can be computed at high speed using the proposed scheme.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.