Research on Direct Anonymous Attestation Scheme Based on Bilinear Pairing

doi:10.13190/j.jbupt.2014.06.015

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2014, Vol. 37 ›› Issue (6): 72-76.doi: 10.13190/j.jbupt.2014.06.015

• Papers • Previous Articles Next Articles

Research on Direct Anonymous Attestation Scheme Based on Bilinear Pairing

SONG Cheng, LI Jing, PENG Wei-ping, JIA Zong-pu, LIU Zhi-zhong

College of Computer Sciences and Technology, Henan Polytechnic University, Henan Jiaozuo 454000, China

Received:2014-04-09 Online:2014-12-28 Published:2014-10-17

Abstract

Abstract:

Considering the current directory anonymous attestation (DAA) scheme complicated and time-consuming, which makes it limited in resource-constrained devices such as embedded, an improved DAA scheme is proposed. This scheme is based on bilinear pairing under the assumption of q strong Diffie-Hellman and decisional Diffie-Hellman. The analysis shows that this scheme is not only correct, security and anonymous, but also efficiently relieves the computation cost. This scheme further solves the computation bottleneck and accelerate application for DAA in mobile field.

Key words: trusted computing platform, directory anonymous attestation, bilinear pairing, proof of knowledge

CLC Number:

TP309

SONG Cheng, LI Jing, PENG Wei-ping, JIA Zong-pu, LIU Zhi-zhong. Research on Direct Anonymous Attestation Scheme Based on Bilinear Pairing[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2014, 37(6): 72-76.

References

[1] Brickell E, Camenisch J, Chen Liqun. Direct anonymous attestation[C]//In Proceedings of the 11^th ACM Conference on Computer and Communications Security. New York: ACM Press, 2004: 132-145.

[2] Trusted Computing Group. ISO15408—2007, TCG Specification Architecture Overview[S].

[3] Trusted Computing Group. ISO/IEC11889—2007, TPM Main, Part 1: Design Principles[S].

[4] Pearson S, Balacheff B, Chen Liqun, et al. Trusted computing platforms: TCPA technology in context[M]. Upper Saddle River: Prentice Hall Press, 2002, 1-352.

[5] Ge He, Tate S R. A direct anonymous attestation scheme for embedded devices[C]//Hutchison D, Kanade T, Kleinberg J M, et al. LNCS. Heidelberg: Springer, 2007: 16-30.

[6] Brickell E, Chen Liqun, Li Jiangtao. A new direct anonymous attestation scheme from bilinear maps[C]//Hutchison D, Kanade T, Kleinberg J M, et al. LNCS. Heidelberg: Springer, 2008: 166-178.

[7] Brickell E, Chen Liqun, Li Jiangtao. Simplified security notions of direct anonymous attestation and a concrete scheme from pairings[J]. International Journal of Information Security, 2009, 8(5): 315-330.

[8] Chen Liqun, Morrissey P, Smart N P. Pairings in trusted computing[C]// Hutchison D, Kanade T, Kleinberg J M, et al. LNCS. Heidelberg: Springer, 2008: 1-17.

[9] Chen Liqun. A DAA scheme requiring less TPM resources[C]// Hutchison D, Kanade T, Kleinberg J M, et al. LNCS. Heidelberg: Springer, 2009: 111-125.

[10] Chen Liqun, Morrissey P, Smart N P. DAA: fixing the pairing based protocols[Z]. Cryptology ePrint Archive, Report 2009/198, 2009.

[11] Chen Xiaofeng, Feng Dengguo. Direct anonymous attestation for next generation TPM[J]. Journal of Computers, 2008(12): 43-50.

[12] Brickell E, Li Jiangtao. A pairing-based DAA scheme further reducing TPM resouses[C]// Hutchison D, Kanade T, Kleinberg J M, et al. LNCS. Heidelberg: Springer, 2010: 181-195.

[13] 宋成, 孙玉琼, 彭维平, 等. 改进的直接匿名认证方案[J]. 北京邮电大学学报, 2011, 34(3): 62-65. Song Cheng, Sun Yuqiong, Peng Weiping, et al. Improved direct anonymous attestation scheme[J]. Journal of Beijing University of Posts and Telecommunications, 2011, 34(3): 62-65.

[14] He Yingying, Chen Liquan, Wang Lingling. An improved direct anonymous attestation scheme for M2M networks[J]. Elsevier Procedia Engineering, 2011, 5: 1481-1486.

[15] Zhang Dedong, Ma Zhaofeng, Niu Xinxin, et al. Anonymous authentication scheme of trusted mobile terminal under mobile Internet[J]. The Journal of China Universities of Posts and Telecommunications, 2013, 20(1): 58-65.

[16] Lysyanskaya A, Rives R L, Sahai A, et al. Pseudonym systems[C]// Hutchison D, Kanade T, Kleinberg J M, et al. LNCS. Heidelberg: Springer, 2000: 184-199.

[17] Boneh D, Boyen X. Short signatures without random oracles[C]//Hutchison D, Kanade T, Kleinberg J M, et al. LNCS. Heidelberg: Springer, 2004: 56-73.

[18] Boneh D, Boyen X, Shacham H. Short group signatures[C]//Hutchison D, Kanade T, Kleinberg J M, et al. LNCS. Heidelberg: Springer, 2004: 41-55.

Research on Direct Anonymous Attestation Scheme Based on Bilinear Pairing

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 11

Recommended Articles

Metrics

Comments

[1]	PENG Weiping, HAN Ning, SONG Cheng. Certificateless Identity Authentication Scheme for Internet of Vehicles in Edge Computing Environment [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(1): 46-51.
[2]	ZHOU Cai-xue. Cryptanalysis and Improvement of Certificate-Based Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2013, 36(6): 98-101.
[3]	YANG Bo, XIAO Zi-bi. Efficient Certificate-Based Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2012, 35(5): 73-76.
[4]	. Cryptanalysis and Improvement of a Certificateless  Strong Proxy Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(5): 115-118.
[5]	. Improved Direct Anonymous Attestation Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(3): 62-65.
[6]	. Provably Secure IdentityBased Signature Scheme in the Standard Model [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(1): 99-102.
[7]	. Short Signcryption Scheme with Forward Security and Ciphertext Anonymity [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(4): 131-134.
[8]	SUN Shi-feng；WEN Qiao-yan. An Attack on a Certificateless Strong Proxy Signature Scheme and Its Improvement [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(1): 80-83.
[9]	DU Hong-zhen1.2, WEN Qiao-yan1, LI Wen-min1, JIN Zheng-ping1. Efficient Certificateless Strong Proxy Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(6): 18-21.
[10]	WANG Ling-ling, ZHANG Guo-yin, MA Chun-guang . A Short Linkable Ring Signature Scheme for E-Cash Protocol [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(1): 102-106.
[11]	YU Yong1, YANG Bo2, LI Fa-gen1, ZHANG Ming-wu2. An Efficient Proxy Ring Signature Scheme [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2007, 30(3): 23-26.