Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2010, Vol. 27 ›› Issue (2): 263-266.DOI: 10.7523/j.issn.2095-6134.2010.2.018

• Research Articles • Previous Articles     Next Articles

A note on pseudorandomness and unforgeability of MACs

WANG Peng   

  1. State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100049, China
  • Received:2009-01-15 Revised:2009-12-07 Online:2010-03-15

Abstract:

In Ref.[1] the authors proved the pseudorandomness of XOR-MAC(the tag generation algorithm of XOR-MAC is indistinguishable from a random function), based on which they claimed that they gave a new security proof for XOR-MAC. We have studied Wegman-Carter MAC and show that the pseudorandomness of randomized or statefull MACs does not imply the security of MACs, namely the unforgeability.

Key words: message authentication code, provable security, unforgeability, pseudorandom function

CLC Number: