欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2010, Vol. 27 ›› Issue (2): 263-266.DOI: 10.7523/j.issn.2095-6134.2010.2.018

• 论文 • 上一篇    下一篇

一个关于MAC伪随机性与不可伪造性的注记

王鹏   

  1. 中国科学院研究生院信息安全国家重点实验室,北京 100049
  • 收稿日期:2009-01-15 修回日期:2009-12-07 发布日期:2010-03-15
  • 基金资助:

    国家自然科学基金(60903219)和中国科学院研究生院院长基金项目资助

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 Published:2010-03-15

摘要:

文献[1]证明了XOR-MAC的伪随机性,即XOR-MAC的标签生成算法和随机函数不可区分,进而宣称给出了XOR-MAC的安全性新证明.本文通过对Wegman-Carter MAC的研究, 说明了随机的或者带状态的MAC的伪随机性并不意味着MAC的安全性,即不可伪造性.

关键词: 消息认证码, 可证明安全, 不可伪造性, 伪随机函数

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

中图分类号: