期刊文献+

基于有限计算端的双向认证密钥交换协议 被引量:1

Mutual Authentication Key Exchange Protocol for Low Power Computing Device
在线阅读 下载PDF
导出
摘要 身份认证和密钥交换技术是保证无线通信安全的重要手段。针对非接触式智能卡的需求,提出一种基于有限计算能力的相互认证密钥交换协议。在随机预言模型下证明该协议的安全性,结果表明,该协议可有效抵抗重放攻击、中间人攻击和交错攻击,计算量较小,实用性较高。 Identity authentication and key exchange technology is the important means to ensure wireless communication security. Aiming at the demand of contactless smart card,this paper proposes a new mutual authentication key exchange protocol based on low power computing devices. The protocol is secure against replay attacks,man-in-the-middle attacks and interleaving attacks,and the security of the protocol is proved in the random oracle model. Result shows that the designed protocol is of good feasibility and needs smaller computing power.
作者 冯静 许勇
出处 《计算机工程》 CAS CSCD 北大核心 2010年第2期137-140,共4页 Computer Engineering
关键词 密钥交换 身份认证 随机预言模型 非接触式智能卡 key exchange identity authentication random oracle model contactless smart card
  • 相关文献

参考文献5

  • 1Jakobsson M, Pointcheval D. Mutual Authentication for Low-power Mobile Devices[C]//Proc. of CRYPTO'01. Heidelberg, Germany: [s. n.], 2001: 178-195.
  • 2Wong D S, Chart A H. Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices[C]//Proc. of Asia-CRYPT'01. Berlin, Germany: [s. n.], 2001: 272-289.
  • 3Wen Hsiang-An, Lin Chun-Li, Hwang Tzonelih. Provably Secure Authenticated Key Exchange Protocols for Low Power Computing Clients[J]. Computers & Security, 2006, 25(2): 106-113.
  • 4Bellare M, Rogaway P. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols[C]//Proc. of the 1st ACM Conference on Computer and Communications Security. New York, USA: ACM Press, 1993: 62-73.
  • 5Bellare M, Rogaway P. Entity Authentication and Key Distribution[C]// Proc. of CRYPTO'93. Berlin, Germany: [s. n.], 1994: 232-249.

同被引文献10

  • 1Shamir A.How to Share a Secret[J].Communications of the ACM,1979,22(11):612-613.
  • 2Blakley G.Safeguarding Cryptographic Key[C] //Proc.of AFIPS'79.New York,USA:[s.n.] ,1979:313-317.
  • 3Asmuth C,Blakley G.Pooling Splitting and Reconstituting Information to Overcome Total Failture of Some Channels of Communication[C] //Proc.of the Symposium on Security and Privacy.[S.1.] :IEEE Press,1982:156-169.
  • 4Kamin E,Greene J,Hellman M.On Secret Sharing Systems[J].IEEE Transaction on Information Theory,1983,29(1):35-41.
  • 5Chor B,Goldwasser S,Micali S,et al.Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults[C] //Proc.of the 26th IEEE Symposium Foundation of Computer Science.Portland,USA:[s.n.] ,1985:383-395.
  • 6Hankerson D,Menezes A,Vanstones S.Guide to Elliptic Curve Crypotography[M].New York,USA:Springer-Verlag,2004.
  • 7Liu Duo,Huang Dongping,Luo Ping,et al.New Schemes for Sharing Points on an Elliptic Curve[J].Computers and Mathematics with Applications,2008,56(6):1556-1561.
  • 8Lee H S.A Self-paring Map and Its Applications to Cryptography[J].Applied Mathematics and Computation,2004,151(3):671-678.
  • 9He J,Dawson E.Multistage Secret Sharing Based on One-way Function[J].Electronnics Letters,1994,30(19):1591-1592.
  • 10张建中,李文敏.基于LUC密码体制的广义秘密共享方案[J].计算机工程,2008,34(8):162-163. 被引量:7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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