电子学报 ›› 2006, Vol. 34 ›› Issue (10): 1812-1816.

• 论文 • 上一篇    下一篇

一种可证明安全的消息认证码

王大印, 林东岱, 吴文玲   

  1. 中国科学院软件研究所信息安全国家重点实验室,北京 100080
  • 收稿日期:2005-05-20 修回日期:2006-07-16 出版日期:2006-10-25 发布日期:2006-10-25

A New Message Authentication Code and Its Security Proof

WANG Da-yin, LIN Dong-dai, WU Wen-ling   

  1. State Key Laboratory of Information Security,Institute of Software,Chinese Academy of Sciences,Beijing 100080,China
  • Received:2005-05-20 Revised:2006-07-16 Online:2006-10-25 Published:2006-10-25

摘要: 消息认证码是保证消息完整性的重要工具,它广泛应用于各种安全系统中.随着可证明安全理论的逐渐成熟,具备可证明安全的消息认证码无疑成为人们的首选.本文基于XOR MAC和PMAC的构造方法,使用分组密码构造了一种确定性、可并行的消息认证码-DXOR MAC(Deterministic XOR MAC).在底层分组密码是伪随机置换的假设下,本文使用Game-Playing技术量化了攻击者成功伪造的概率,从而证明了其安全性.

关键词: 消息认证码, 伪随机置换, 可证明安全, Game-Playing

Abstract: The most important tool to protect data integrity is Message Authentication Code(MAC),which is widely used in many kinds of secure systems.With the development of the theory of provable security,the MACs,which have security proof,are the first choice of many people.Based on the constructions of XOR MAC and PMAC,we define a deterministic fully parallelizable block-cipher mode of operation for message authentication-DXOR MAC(Deterministic XOR MAC).We prove its security,quantifying an adversary's forgery probability in terms of the quality of the block cipher as a pseudo-random permutation.

Key words: message authentication code, pseudo-random permutation, provable security, game-playing

中图分类号: