期刊文献+

直接匿名证言协议的性能估算新方法 被引量:2

A New Method of Performance Estimate of Direct Anonymous Attestation Scheme in TCG
下载PDF
导出
摘要 性能问题是阻碍DAA推广和应用的首要问题.为了进一步优化该协议的性能,找出性能瓶颈,定量地分析和测量DAA中各个实体的性能负荷分布是一个十分重要且必须的工作.文中详细分析了DAA的协议流程,提出了以机器周期为基本性能单位的性能负荷分布测量方法——归一化统计法(Normalized Statistics,NS).该方法需要首先分析DAA协议中的各种复杂运算,针对不同的运算选用当前性能较好的算法,然后统计各个算法中大整数单精度乘法、单精度加法、读内存、写内存等基本运算的数目,最后通过汇总并转换得出DAA协议中各实体以机器周期为单位的性能负荷分布和总性能负荷.比较分析表明,该方法不仅能相对准确、精细、有效地定量计算出DAA协议中各实体的性能负荷和总的性能负荷,而且测出的性能负荷具有平台无关性.最后为了说明该方法的有效性,将NS方法应用于有关可信计算匿名证明的一个典型方案的性能负荷估算. Performance is a most important problem to Direct Anonymous Attestation Scheme in TCG.It is very necessary and important to analyze and measure performance to every entity quantitatively for optimizing DAA.In this paper,DAA protocol is first analysed detailedly,and then a new performance measurement method,called Normalized Statistics method,which takes the machine period as the basic performance unit,is put forward.When using this method,all complex calculates in DAA protocol must be found out and statistic,and better algorithms to every complex calculate are chosen,moreover,to each algorithms,we need to compute the sum for each basic operation,such as multiplication of single big integer,addition of single big integer,reading and writing memory,and so on.Finally,the every entity performance and the whole performance burden in DAA,whose unit is the machine period,are summed.The theoretical analysis results show that the performance estimate is exact,meticulous and effective by this method which is independent of actual platform.For proving availability of the method,we apply it to estimate performance of other one DAA scheme.
出处 《计算机学报》 EI CSCD 北大核心 2012年第7期1553-1562,共10页 Chinese Journal of Computers
基金 国家自然科学基金(60970113) 国家自然科学基金青年基金(60903073)资助~~
关键词 可信计算 直接匿名证言 Camenisch-Lysyanskaya签名 知识证明 性能负荷 trusted computing direct anonymous attestation Camenisch-Lysyanskaya sign knowledge proof performance burden
  • 相关文献

参考文献16

  • 1Brickell E, Camenisch J, Chen L. Direct anonymous attesta- tion//Proceedings of the 1 lth ACM Conference on Computer and Communications Security. Washington, DC, USA, 2004:132-145.
  • 2Camenisch J, Lysyanskaya A. A signature scheme with effi- eient protoeols//Proeeedings of the 3rd International Confer- ence on Security in Communication Networks. Amalfi, Italy, 2003:268-289.
  • 3Fiat A, Shamir A. How to prove yourself: Practical solu- tions to identification and signature problems~/Proceedings of Advances in Cryptology-CRYPTO' 86. London, UK, 1987 186-194.
  • 4Chen Xiaofeng, Feng Dengguo. Direct anonymous attestation for next generation TPM. Journal of Computers, 2008, 3(12) :43-50.
  • 5Backes Michael, Maffei Matteo, Unruh Dominique. Zero- knowledge in the applied pi-calculus and automated verifica- tion of the direct anonymous attestation protocol//Proceed- ings of the IEEE Symposium on Security and Privacy. Oakland, California, USA, 2008:202-215.
  • 6Brickell Ernie, Chen Liqun, Li Jiangtao. A new direet anon- ymous attestation scheme from bilinear maps//Proceedings of the 1st International Conference on Trusted Computing.Villach, Austria, 2008:166-178.
  • 7Briekell Ernie, Chen Liqun, Li Jiangtao. Simplified security notions of direct anonymous attestation and a concrete scheme from pairings. International Journal of Information Security, 2009, 8(5): 315-330.
  • 8Brickell Ernie, Li Jiangtao. Enhanced privacy ID: A direct anonymous attestation scheme with enhanced revocation ca- pabilities//Proceedings of the 6th ACM Workshop on Privacy in the Electronic Society. Alexandria, VA, USA, 200?: 21-30.
  • 9Brickell Ernie, Li Jiangtao. A pairing-based DAA scheme further reducing TPM resources//Trust and Trustworthy Computing. Lecture Notes in Computer Science 6101. Heidelberg: Springer, 2010:181-195.
  • 10Chen Liqun. A DAA scheme requiring less TPM resources// Proceedings of the 5th China International Conference on In- formation Security and Cryptology. Beijing, China, 2009: 211-219.

同被引文献17

引证文献2

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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