
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ernie Brickell, Jiangtao Li, "Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities," IEEE Transactions on Dependable and Secure Computing, vol. 9, no. 3, pp. 345360, May/June, 2012.  
BibTex  x  
@article{ 10.1109/TDSC.2011.63, author = {Ernie Brickell and Jiangtao Li}, title = {Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities}, journal ={IEEE Transactions on Dependable and Secure Computing}, volume = {9}, number = {3}, issn = {15455971}, year = {2012}, pages = {345360}, doi = {http://doi.ieeecomputersociety.org/10.1109/TDSC.2011.63}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Dependable and Secure Computing TI  Enhanced Privacy ID: A Direct Anonymous Attestation Scheme with Enhanced Revocation Capabilities IS  3 SN  15455971 SP345 EP360 EPD  345360 A1  Ernie Brickell, A1  Jiangtao Li, PY  2012 KW  Security and protection KW  anonymity KW  privacy KW  cryptographic protocols KW  trusted computing. VL  9 JA  IEEE Transactions on Dependable and Secure Computing ER   
[1] E. Brickell, J. Camenisch, and L. Chen, "Direct Anonymous Attestation," Proc. 11th ACM Conf. Computer and Comm. Security, pp. 132145, 2004.
[2] Trusted Computing Group Website, http:/www. trustedcomputinggroup.org , 2011.
[3] Trusted Computing Group, "TCG TPM Specification 1.2," http:/www.trustedcomputinggroup.org, 2003.
[4] D. Boneh and H. Shacham, "Group Signatures with VerifierLocal Revocation," Proc. 11th ACM Conf. Computer and Comm. Security, pp. 168177, Oct. 2004.
[5] J. Camenisch and A. Lysyanskaya, "A Signature Scheme with Efficient Protocols," Proc. Third Conf. Security in Comm. Networks, pp. 268289, 2002.
[6] G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, "A Practical and Provably Secure CoalitionResistant Group Signature Scheme," Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '00), pp. 255270, 2000.
[7] D. Boneh, X. Boyen, and H. Shacham, "Short Group Signatures," Proc. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '04), pp. 4155, 2004.
[8] J. Camenisch and M. Stadler, "Efficient Group Signature Schemes for Large Groups," Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '97), pp. 410424, 1997.
[9] D. Chaum and E. van Heyst, "Group Signatures," Proc. Ann. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '91), pp. 257265, 1991.
[10] J. Kilian and E. Petrank, "Identity Escrow," Proc. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '98), pp. 169185, 1998.
[11] J. Camenisch and A. Lysyanskaya, "An Efficient System for NonTransferable Anonymous Credentials with Optional Anonymity Revocation," Proc. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '01), pp. 93118, 2001.
[12] D. Chaum, "Security without Identification: Transaction Systems to Make Big Brother Obsolete," Comm. ACM, vol. 28, no. 10, pp. 10301044, 1985.
[13] S.A. Brands, Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy. MIT Press, Aug. 2000.
[14] E. Bresson and J. Stern, "Efficient Revocation in Group Signatures," Proc. Fourth Int'l Workshop Practice and Theory in Public Key Cryptography, pp. 190206, 2001.
[15] D.X. Song, "Practical Forward Secure Group Signature Schemes," Proc. Eighth ACM Conf. Computer and Comm. Security, pp. 225234, 2001.
[16] J. Camenisch and A. Lysyanskaya, "Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials," Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '02), pp. 6176, 2002.
[17] G. Ateniese, D.X. Song, and G. Tsudik, "QuasiEfficient Revocation in Group Signatures," Proc. Sixth Int'l Conf. Financial Cryptography, pp. 183197, 2002.
[18] P.P. Tsang, M.H. Au, A. Kapadia, and S.W. Smith, "Blacklistable Anonymous Credentials: Blocking Misbehaving Users without TTPs," Proc. ACM Conf. Computer and Comm. Security, pp. 7281, 2007.
[19] R. Canetti, "Studies in Secure Multiparty Computation and Applications," PhD dissertation, Weizmann Inst. of Science, Rehovot, Israel, 1995.
[20] R. Canetti, "Security and Composition of Multiparty Cryptographic Protocols," J. Cryptology, vol. 13, no. 1, pp. 143202, 2000.
[21] B. Pfitzmann and M. Waidner, "Composition and Integrity Preservation of Secure Reactive Systems," Proc. Seventh ACM Conf. Computer and Comm. Security, pp. 245254, Nov. 2000.
[22] B. Pfitzmann and M. Waidner, "A Model for Asynchronous Reactive Systems and Its Application to Secure Message Transmission," Proc. IEEE Symp. Security and Privacy, pp. 184200, 2001.
[23] A. Fiat and A. Shamir, "How to Prove Yourself: Practical Solutions to Identification and Signature Problems," Proc. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '86), pp. 186194, 1987.
[24] D. Pointcheval and J. Stern, "Security Proofs for Signature Schemes," Proc. Ann. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '96), pp. 387398, 1996.
[25] C.P. Schnorr, "Efficient Identification and Signatures for Smart Cards," J. Cryptology, vol. 4, no. 3, pp. 161174, 1991.
[26] I. Damgård and E. Fujisaki, "An Integer Commitment Scheme Based on Groups with Hidden Order," Int'l Cryptology Conf. Advances in Cryptology (ASIACRYPT '02), pp. 125142, Dec. 2002.
[27] E. Fujisaki and T. Okamoto, "Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations," Proc. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '97), pp. 1630, 1997.
[28] D. Chaum, J.H. Evertse, and J. van de Graaf, "An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations," Proc. Ann. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '87), pp. 127141, 1987.
[29] D. Chaum, "ZeroKnowledge Undeniable Signatures," Proc. Ann. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '90), pp. 458464, 1990.
[30] D. Chaum and T.P. Pedersen, "Wallet Databases with Observers," Proc. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '92), pp. 89105, 1992.
[31] E.F. Brickell, D. Chaum, I. Damgård, and J. van de Graaf, "Gradual and Verifiable Release of a Secret," Proc. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '87), pp. 156166, 1987.
[32] J. Camenisch and M. Michels, "Separability and Efficiency for Generic Group Signature Schemes," Proc. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '99), pp. 413430, 1999.
[33] F. Boudot, "Efficient Proofs that a Committed Number Lies in an Interval," Proc. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '00), pp. 431444, May 2000.
[34] R. Cramer, I. Damgård, and B. Schoenmakers, "Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols," Proc. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '94), pp. 174187, 1994.
[35] A.K. Lenstra and E.R. Verheul, "Selecting Cryptographic Key Sizes," J. Cryptology, vol. 14, no. 4, pp. 255293, 2001.
[36] J. Camenisch and M. Michels, "Proving in ZeroKnowledge that a Number is the Product of Two Safe Primes," Proc. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '99), pp. 106121, 1999.
[37] M. Bellare, J.A. Garay, and T. Rabin, "Fast Batch Verification for Modular Exponentiation and Digital Signatures," Proc. Int'l Conf. Theory and Application of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT '98), pp. 236250, 1998.
[38] J. Camenisch and V. Shoup, "Practical Verifiable Encryption and Decryption of Discrete Logarithms," Proc. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '03), pp. 126144, 2003.