David C, Kent Y, Ryan C, et al. 可信计算[M]. 赵波,严飞,余发江,等译. 北京:机械工业出版社,2008.
[3]
Trusted Computing Group. Mobile trusted module FAQ[J/OL]. http://www.trustedcomputinggroup.org.
[4]
Trusted Computing Group. Trusted Computing Group TPM specification Version 1.2[EB/OL]. http://www.trustedcomputinggroup.org,2003.
[5]
Brickell E, Camenisch J, Chen L. Direct anonymous attestation[C]//Proceedings of the 11th Conference on Computer and Communications Security. IEEE:ACM Press,2004:132-145.
[6]
Camenisch J, Lysyanskaya A. A signature scheme with efficient protocols[C]//Proceedings of the 3rd International Conference on Security in Communication Networks. New York:Springer-Verlag,2003:268-289.
[7]
Fujisaki E, Okamoto T. Statistical zero knowledge protocols to prove modular polynomial relations[C]//Kaliski B. Advances in Cryptology - CRYPTO'97. LNCS 1294. New York:Springer-Verlag,1997:16-30.
[8]
Fiat A, Shamir A. How to prove yourself: Practical solutions to identification and signature problems[C]//Advances in Cryptology-CRYPTO '86. LNCS.263. New York:Springer-Verlag,1987:186-194.
[9]
Ge H, Tate S R. A direct anonymous attestation scheme for embedded devices[C]//Public Key Cryptograph. New York:Springer-Verlag,2007.
[10]
Brickell E, Li J T. Enhanced privacy ID: A direct anonymous attestation scheme with enhanced revocation capabilities[C]//Proceedings of the 6th ACM Workshop on Privacy in the Electronic Society. IEEE:ACM Press,2007:21-30.
[11]
Brickell E, Chen L, Li J. Simplified security notions for direct anonymous attestation and a concrete scheme from pairings[J]. Int J Information Security,2009,8:315-330.
[12]
Brickell E, Chen L, Li J. A new direct anonymous attestation scheme from bilinear maps[C]//Trusted Computing Challenges and Applications-TRUST 2008. New York:Springer-Verlag,2008:166-178.
[13]
Chen L, Morrissey P, Smart N P. Pairings in trusted computing[C]//Pairings in Cryptography Pairing 2008. New York:Springer-Verlag,2008:1-17.
[14]
Chen L, Morrissey P, Smart N P. On proofs of security of DAA schemes[C]//Provable Security Prov Sec 2008. New York:Springer-Verlag,2008:167-175.
[15]
Chen L, Morrissey P, Smart N P. DAA: Fixing the pairing based protocols[C/OL]//Cryptology ePrint Archive:Report 2009/198. http://eprint.iacr.org/2009/198.
[16]
Roger N, Michael S. Using encryption for authentication in large networks of computers[J]. Communications of the ACM,1978,21(12):993-999.
[17]
Lower G. An attack on the needham-schroeder public-key authentication protocol[J]. Information Processing Letters,1995,56(3):131-133.
[18]
Lower G. Breaking and fixing the Needham-Schroeder public-key protocol using FDR[C]//Tools and Algorithms for the Construction and Analysis of Systems TACAS '96. LNCS.1055. Passau:Springer-Verlag,1996:147-166.
