期刊文献+

M2M网络上的改进直接匿名认证方案 被引量:3

Improved direct anonymous attestation scheme in M2M network system
下载PDF
导出
摘要 针对现有可信计算平台中的直接匿名认证(DAA)方案存在计算过于复杂的问题,在已有的DAA协议基础上,结合M2M网络特点,提出了一种适用于M2M网络的I-DAA方案.该方案建立在椭圆曲线上的离散对数困难性问题的基础上,利用零知识证明和双线性映射理论,在证书申请阶段将部分DAA证书中原来由TPM计算的参数改为用系统公开参数替代,极大降低了资源相对较宝贵的TPM模块的计算量.同时,该方案中TPM的秘密信息改由TPM自己选取,从而减少不必要的计算开销.另外,TPM只需要申请一次DAA证书,以后即可直接向验证方提交验证信息,避免了一些现有协议的通信瓶颈.分析结果表明,I-DAA方案在保证安全的前提下降低了总体系统中尤其是TPM侧的计算复杂度,更适合于M2M系统及其他嵌入式系统应用环境. Current anonymous attestation protocols(DAA) used in trusted computing platform always accompany with complicated computing.To solve this problem,the I-DAA protocol is proposed based on the mechanisms of existing DAA protocols and the characteristics of M2M network.Based on the theory of elliptic curve and the difficult problem of discrete logarithm,I-DAA also uses the zero knowledge proof and bilinear pairing theories.At the certification application stage,the public system parameters instead of those computed by TPM are used as certificated parameters to reduce the computational complexity of TPM whose computing ability is relatively more valuable.TPM selects the secret information by itself,which also reduces the computation cost of TPM.Moreover,it only needs to apply one time of DAA certification for TPM to use forever in the latter verification processing.This avoids the bottleneck of traditional DAA protocols.The analysis results show that the I-DAA scheme not only remains the security level of the traditional DAA protocols but also has great reduction of computational complexity,which makes it more suitable for M2M systems and other embedded application systems.
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2012年第4期604-608,共5页 Journal of Southeast University:Natural Science Edition
基金 国家自然科学基金资助项目(60902008) 信息网络安全公安部重点实验室开放课题资助项目(2010011)
关键词 M2M 可信计算平台 直接匿名认证 双线性对 M2M(machine to machine) TPM(trusted platform module) DAA(direct anonymous attestation) bilinear pairing
  • 相关文献

参考文献12

  • 1Wu G, Talwar S, Johnsson K, et al. M2M: from mo- bile to embedded internet E J 1. IEEE Communications Magazine, 2011,49(4) : 36 -43.
  • 2Sun Wenchao, Song Meina. A general M2M device model C ]//IEEE 2nd Symposium on Web Society. Bei- jing, China,2010 : 578 - 581.
  • 3Potter B. High time for trusted computing [ J 1. IEEE Security &Privacy, 2009,7(6) : 54-56.
  • 4Kim Mooseop, Ju Hongil, Kim Youngsae, et al. De1 sign and implementation of mobile trusted module fo1 trusted mobile computing [ J ]//IEEE Transactions or4Consumer Electronics, 2010, 56( 1 ) :134 - 140.
  • 5Chen Liqun, Warinschi B. Security of the TCG Prlva- cy-CA solution [ C 1//IEEE/1FIP 8 th International Con- ference on Embedded Ubiquitous Computing. Hong Kong, China, 2010:609 - 616.
  • 6Li Lixin, Li Chaoling, Zhou Yanzhou. A remote anon- ymous attestation scheme with improved privacy CA [ C 1//International Conference on Multimedia Informa- tion Networking and Securi.'. Wuhan, China, 2009 : 153 - 157.
  • 7Brickell E, Camenisch J, Chen L Q. Direct anonymous attestation I C ]//Proceedings of the 11 th ACM Confer- ence on Computer and Communications Securi. New York,USA, 2004 : 132 - 145.
  • 8Brickell E, Chen Liqun, Li Jiangtao. A new direct anonymous attestation scheme from bilinear maps [ C ]// Proceedings of First International Conference on Trusted Computing and Trust in Information Technologies. Vil- lach, Austria,2008 : 166 - 178.
  • 9Chen Liqun, Morrissey P, Smart N P. Pairing in trusted computing [ C ]//Second International Conference on Pairing-Based Cryptography-Pairing. Egham, UK, 2008: 1-17.
  • 10Chen Liqun. A DAA scheme using batch proof and verification [ C ]//Proceedings of Third International Conference on Trust and Trustworthy Computing. Ber- lin, Germany, 2010 : 166 180.

二级参考文献12

  • 1沈昌祥,张焕国,冯登国,曹珍富,黄继武.信息安全综述[J].中国科学(E辑),2007,37(2):129-150. 被引量:358
  • 2Trusted Computing Group.Trusted Computing Platform Alliance(TCPA)Main Specification Version 1.1b. . 2001
  • 3Trusted Computing Group.TCG TPM Specification Version 1.2. http://www.Trustedcomputinggroup.org . 2005
  • 4FREEMAN D,SCOTT M,TESKE E.A taxonomy of pairing-friendlyelliptic curves. http://eprint.iacr.org/2006/372 . 2006
  • 5Menezes A,Okamoto T,Vanstone S A.Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory . 1993
  • 6Brickell E,Camenisch J,Chen L.Direct Anonymous Attestation. Proceedings of the llth ACM Conference on Com puter and Communications Security . 2004
  • 7Miyaji,A,Nakabayashi,M,Takano,S.New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences . 2001
  • 8Ben Lynn.ON THE IMPLEMENTATION OF PAIRING-BASED CRYPTOSYSTEMS. . 2007
  • 9B. Libert.New secure applications of bilinear map in cryptography. . 2006
  • 10Brickell E,Chen Li-qun,Li Jiang-tao.Simplified security notions of direct anonymous attestation and a concrete scheme from pairings. The Conference on Trusted Computing(TRUST2008) . 2008

共引文献2

同被引文献19

引证文献3

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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