期刊文献+

一种可证明安全的消息认证码 被引量:3

A New Message Authentication Code and Its Security Proof
下载PDF
导出
摘要 消息认证码是保证消息完整性的重要工具,它广泛应用于各种安全系统中.随着可证明安全理论的逐渐成熟,具备可证明安全的消息认证码无疑成为人们的首选.本文基于XOR MAC和PMAC的构造方法,使用分组密码构造了一种确定性、可并行的消息认证码-DXOR MAC(Deterministic XOR MAC).在底层分组密码是伪随机置换的假设下,本文使用Game-Playing技术量化了攻击者成功伪造的概率,从而证明了其安全性. 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 authenficafion-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.
出处 《电子学报》 EI CAS CSCD 北大核心 2006年第10期1812-1816,共5页 Acta Electronica Sinica
基金 国家863高技术研究发展计划基金(No.2003AA144030) 国家973重点基础研究发展规划基金(No.2004CB318004) 国家自然科学基金(No.60373047 No.90204016)
关键词 消息认证码 伪随机置换 可证明安全 Game-Playing message authentication code pseudo-random permutation provable security game-playing
  • 相关文献

参考文献10

  • 1M Bellare,R Canetti,H Krawczyk.Keying hash functions for message authentication[A].Advances in Cryptology-CRYPTO'96,LNCS 1109[C].Berlin:Springer-Verlag,1996.1-19.
  • 2M Bellare,J Kiliany,P Rogaway.The security of the cipher block chaining message authentication code[J].Journal of Computer and System Sciences,2000.61 (3),362-399.
  • 3M Bellare,Roch Guerin,P Rogaway.XOR MACS:New methods for message authentication using finite pseudorandom functions[A].Advances in Cryptology-CRYPTO' 95,LNCS 963[C].Berlin:Springer-Verlag,1995.15-28.
  • 4J.Black,P.Rogaway.A block-cipher mode of operation for parallelizable message authentication[A].Advances in Cryptology-EUROCRYPT' 2002,LNCS 2332[C].Berlin:SpringerVerlag,2002.384-401.
  • 5S.Goldwasser M.Bellare.Lecture Notes on Cryptography[G].http://www.cse.ucsd.edu/users/mihir/crypto-lecnotes.html.
  • 6O Goldreich,S Goldwasser,and S Micali.How to construct random functions[J].Journal of the ACM,1986,33(4):210-217
  • 7M Bellare,P Rogaway.The Game-Playing Technique[Z].Cryptology ePrint Archive,Report 2004/331 http://eprint.iacr.org/.
  • 8Victor Shoup.Sequences of games:a tool for taming complexity in security proofs[Z].Cryptology ePrint Archive,Report 2004/332 http://eprint.iacr.org/.
  • 9Dowon Hong,Ju-sung Kang.Bart preneel a concrete security analysis for 3GPP-MAC[A].FSE 2003,LNCS 2887[C].Berlin:Springer-Verlag,2003.154-169.
  • 10D Bernstein.How to stretch random fmctions:The security of protected counter sums[J].Journal of Cryptography.1999.12:185-192.

同被引文献30

引证文献3

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部