Cryptology ePrint Archive: Report 2013/444

Sequential message authentication code without random oracles

Bin Wang and Xiaojing Hong

Abstract: Katz et al. provided a generic transform to construct aggregate message authentication codes and imposed a lower bound on the length of one aggregate MAC tag. The lower bound shows that the required tag length is at least linear with the number of messages when fast verification such as constant or logarithmic computation overhead is required. Aggregate message authentication codes are useful in settings such as mobile ad-hoc networks where devices are resource-constrained and energy cost is at a premium. In this paper, we introduce the notion of sequential aggregate message authentication code (SAMAC). We present a security model for this notion under unforgeability against chosen message and verification query attack and construct an efficient SAMAC scheme by extending a number-theoretic MAC construction due to Dodis et al. We prove the security of our SAMAC scheme under the CDH assumption in the standard model. Our SAMAC scheme improves the lower bound with the help of the underlying algebraic structure. Performance analysis shows that our SAMAC scheme yields constant computation for the verifier as well as fixed length for one aggregate.

Category / Keywords: public-key cryptography / Message authentication code; Sequential aggregate; CDH assumption; Chosen message and verification query attack

Date: received 15 Jul 2013

Contact author: jxbin76 at yeah net

Available format(s): PDF | BibTeX Citation

Version: 20130722:121356 (All versions of this report)

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]