Brickell E, Camenisch J, Chen Liqun. Direct anonymous attestation//CCM2004. : ACM Press, 2004: 132-145.
[2]
Ge He, Tate S R. A direct anonymous attestation scheme for embedded devices[J]. Lecture Notes in Computer Science, 2007, 4450: 16-30.
[3]
Brickell E, Chen Liqun, Li Jiangtao. A new direct anonymous attestation scheme from bilinear maps[J]. Lecture Notes in Computer Science, 2008, 4968: 166-178.
[4]
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.
[5]
Chen Liqun, Morrissey P, Smart N P. Pairings in trusted computing[J]. Lecture Notes in Computer Science, 2008, 5209: 1-17.
[6]
Chen Liqun. A DAA scheme requiring less TPM resources[J]. Lecture Notes in Computer Science, 2011, 6151: 350-365.
[7]
Chen Liqun, Morrissey P, Smart N P. DAA: fixing the pairing based protocols. (2009).
[8]
Chen Xiaofeng, Feng Dengguo. Direct anonymous attestation for next generation TPM[J]. Journal of Computers, 2008, 3(12): 43-50.
[9]
Brickell E, Li Jiangtao. A pairing-based DAA Scheme further reducing TPM resources[J]. Lecture Notes in Computer Science, 2010, 6101: 181-195.
[10]
Lysyanskaya A, Rives, R L, Sahai A, et al. Pseudonym systems[J]. Lecture Notes in Computer Science, 2000, 1758: 184-199.
