基于非对称双线性对的直接匿名认证方案

doi:1000-436X(2010)8A-0037-07

摘要/Abstract

摘要：

根据国产可信密码模块(TCM,trusted cryptography module)的直接匿名认证需求，基于非对称双线性对(ABP,asymmetric bilinear pairing)，提出了一种全新的DAA方案——ABP-DAA方案，与已有DAA方案相比，其不仅能够适用于TCM的直接匿名认证，而且更加安全、简单、高效。

关键词: 可信计算, 可信平台认证, 直接匿名认证, 双线性对, 椭圆曲线密码算法

Abstract:

In order to achieve the direct anonymous attestation need of chinese domestic trusted cryptography module (TCM),based on asymmetric bilinear pairings,a presentation of the bran-new DAA scheme:ABP-DAA scheme was given.Comparing with the existing DAA schemes,ABP-DAA scheme is not only adaptable for TCM,but also more secure,more simple and efficient.

Key words: trusted computing, trusted platform attestation, direct anonymous attestation (DAA), bilinear pairing, elliptic curve cryptography

甄鸿鹄,陈越,谭鹏许,郭渊博. 基于非对称双线性对的直接匿名认证方案[J]. 通信学报, 2010, 31(8A): 37-43.

Hong-hu ZHEN,Yue CHEN,Peng-xu TAN,Yuan-bo GUO. Asymmetric bilinear pairing based direct anonymous attestation scheme[J]. Journal on Communications, 2010, 31(8A): 37-43.

图/表 2

表1

CMS-DAA方案主要计算开销"

阶段	参与方	主要计算开销
	TPM	3G₊+2H
申请加入(Join)	Issuer	$(2 + n) G_{+} + 2 G_{+}^{2}$
	Host	6P+H
进行签名(Sign)	TPMHost	G₊+2H4G₊+3G_×+P+H
签名验证(Verify)	Verifier	$n G_{+} + G_{+}^{2} + G_{\times}^{2} + 5 P + 2 H$

表1

表2

ABP-DAA方案全部计算开销"

阶段	参与方	全部计算开销
	TPM	3G₊
申请证书(Apply)	Issuer	$n G_{+} + G_{+}^{2}$
	Host	0
进行认证(Attest)	TPMHost	4G₊0
认证验证(Verify)	Verifier	$n G_{+} + G_{\times}^{2} + 5 P$

表2

参考文献 20

[1]	沈昌祥, 张焕国, 冯登国等. 信息安全综述[J]. 中国科学 E 辑:信息科学, 2007,37(2): 129-150. SHEN C X , ZHANG H G , FENG D F ,et al. Summary of information safety[J]. Science in China(Series E) 2007.37(2): 129-150.
[2]	Trusted Computing Group Trusted Computing Platform Alliance (TCPA) Main Specification Version 1.1b[S]. 2001.
[3]	Trusted Computing Group TCG TPM Specification Version 1.2[S]. . 2005.6.
[4]	国家密码管理局可信计算密码支撑平台功能与接口规范[S].2007. 2007.China Crypto Management office Functionality and Interface Specification of Cryptographicsupport Platform for Trusted Computing[S]. 2007.
[5]	程相国 . 基于双线性对的签名体制的研究[D]. 西安电子科技大学, 2006. CHENG X G . Study on Digital Signatures from Bilinear Pairing[D]. Xidian University, 2006.
[6]	LYNN B . On the Implementation of Pairing-based Cryptosystems[D]. The department of computer science and the committee on graduate studies of Stanford University, 2007.
[7]	Menezes A J , OKAMOTO T , VANSTONE S A . Reducing elliptic curve logarithms to logarithms in a finite field[J]. IEEE Trans Inf Theory, 1993,39(5): 1639-1646.
[8]	BONEH D , BOYEN X , SHACHAM H . Short group signatures[A]. CRYPTO 2004[C]. California,USA, 2004. 41-55.
[9]	LIBERT B . New Secure Applications of Bilinear Maps in Cryptography[D]. Universite Catholique de Louvain, 2006.
[10]	SCOTT M , BENGER N , CHARLEMAGNE M ,et al. Fast hashing to G2 on pairing-friendly curves[A]. Pairing-Based Cryptography-Pairing 2009:Third International Conference[C]. Palo Alto,CA,USA, 2009 102-113.
[11]	BRICKELL E , CAMENISCH J , CHEN L Q . Direct anonymous attestation[A]. Proceedings of the 11th ACM Conference on Computer and Communications Security[C]. NY,USA, 2004 132-145.
[12]	LEUNG A , MITCHELL C J . Ninja:non identity based,privacy preserving authentication for ubiquitous environments[A]. Proceedings of 9th International Conference on Ubiquitous Computing[C]. Innsbruck,Austria,2007, 20074717: 73-90.
[13]	陈小峰, 冯登国 . 一种多信任域内的直接匿名证明方案[J]. 计算机学报, 2008,31(7): 1122-1130. CHEN X F , FENG D G . A direct anonymous attestation scheme in multi-domain environment[J]. Chinese Journal of Computers, 2008,31(7): 1122-1130.
[14]	BRICKELL E , CHEN L Q , LI J T . Simplified security notions of direct anonymous attestation and a concrete scheme from pairings[A]. The Conference on Trusted Computing (TRUST 2008)[C]. Villach,Austria, 2008.
[15]	BRICKELL E , CHEN L Q , LI J T . A new direct anonymous attestation scheme from bilinear maps[A]. Trust 2008[C]. Berlin Heidlberg, 2008. 166-178.
[16]	CHEN L Q , MORRISSEY P , SMART N P . Pairing in trusted computing[A]. Pairing in Cryptography-Pairing 2008[C]. CA,USA, 2008. 1-17.
[17]	汪涛, 杨义先 . 基于OT 的DAA 方案[A]. 第十一届全国青年通信学术会议[C]. 中国绵阳, 2006. WANG T , YANG Y X . OT based DAA protocol[A]. 1994-2008 China Academic Journal Electronic Publishing House[C]. Mianyang,China, 2006.
[18]	FREEMAN D , SCOTT M , TESKE E ,et al. A taxonomy of pairing-friendly elliptic curves[EB/OL]. , 2006.
[19]	SCOTT M , BENGER N , CHARLEMAGNE M ,et al. On the final exponentiation for calculating pairings on ordinary elliptic curves[A]. Pairing-Based Cryptography-Pairing 2009 Third International Conference[C]. Palo Alto,CA,USA, 2009. 78-89.
[20]	MIYAJI A , NAKABAY M , TAKANO S . New explicit conditions of elliptic curve traces for FR-reduction[J]. IEICE Transformations on fundamentals, 2001,E84-A(5): 1234-1242.

相关文章 15

[1]	姜占鹏, 孙铭玮, 黄海, 徐江, 刘志伟, 白瑞, 方舟, 曲家兴. 面向双线性对的 $F_{p^{2}}$ -FIOS模乘算法及其实现架构研究[J]. 通信学报, 2022, 43(2): 100-108.
[2]	何欣枫,田俊峰,刘凡鸣. 可信云平台技术综述[J]. 通信学报, 2019, 40(2): 154-163.
[3]	田俊峰,李天乐. 基于TPA云联盟的数据完整性验证模型[J]. 通信学报, 2018, 39(8): 113-124.
[4]	徐明,李旭如,刘朝斌,马尧. 基于双重代理密钥的船舶自组网门限签名方案[J]. 通信学报, 2018, 39(7): 166-175.
[5]	田俊峰,张永超. 基于改进期望值决策法的虚拟机可信审计方法[J]. 通信学报, 2018, 39(6): 52-63.
[6]	谭良,齐能,胡玲碧. 虚拟平台环境中一种新的可信证书链扩展方法[J]. 通信学报, 2018, 39(6): 133-145.
[7]	陈兴蜀,王伟,金鑫. 基于标签的vTPM私密信息保护方案[J]. 通信学报, 2018, 39(11): 170-180.
[8]	宋成,张明月,彭维平,贾宗璞,刘志中,闫玺玺. 基于双线性对的车联网批量匿名认证方案研究[J]. 通信学报, 2017, 38(6): 49-57.
[9]	王雷,杨明华,刘增良,郑建群. 适于双冗余系统的信任链生成和更新算法[J]. 通信学报, 2017, 38(1): 1-8.
[10]	杜红珍,温巧燕. 无证书强指定验证者多重签名[J]. 通信学报, 2016, 37(6): 20-28.
[11]	冯伟,秦宇,冯登国,杨波,张英骏. 基于TCM的安全Windows平台设计与实现[J]. 通信学报, 2015, 36(8): 91-103.
[12]	王洁,蔡永泉,田有亮. 基于博弈论的门限签名体制分析与构造[J]. 通信学报, 2015, 36(5): 148-155.
[13]	赵振国. 无证书签密机制的安全性分析与改进[J]. 通信学报, 2015, 36(3): 75-80.
[14]	张宇，杜瑞颖，陈晶，侯健，周庆，王文武. 对一个基于身份签密方案的分析与改[J]. 通信学报, 2015, 36(11): 174-179.
[15]	杜红珍,温巧燕. 改进的无证书有序多重签名方案[J]. 通信学报, 2015, 36(10): 56-61.