Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

DAA-A: Direct Anonymous Attestation with Attributes

  • Conference paper
  • First Online:
Trust and Trustworthy Computing (Trust 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9229))

Included in the following conference series:

Abstract

The TPM 2.0 specification has been designed to support a new family of Elliptic Curve (EC) based Direct Anonymous Attestation (DAA) protocols. DAA protocols are limited to anonymous or pseudonymous attestations. But often a more flexible attestation would be needed. For instance, attesting that the platform is a certain model from a certain vendor. Such an attestation would require to bind the attributes “model"and “vendor" to the TPM.

This paper shows how the DAA protocols can be augmented with an arbitrary number of attributes. This gives a new family of protocols called DAA-A, which means DAA with attributes. In a DAA-A protocol, the user of the TPM/platform can select which attributes he will show to the verifier and which attributes he will hide. The authenticity of the hidden attributes will be proved by a zero knowledge protocol. The DAA-A protocols have user controlled linkability in the same way as the DAA protocols. We show explicitly, how the two most prominent EC based DAA protocols for TPM 2.0 can be extended to DAA-A protocols.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bangerter, E., Camenisch, J.L., Lysyanskaya, A.: A cryptographic framework for the controlled release of certified data. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2004. LNCS, vol. 3957, pp. 20–42. Springer, Heidelberg (2006)

    Google Scholar 

  2. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)

    Google Scholar 

  3. Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Proceedings of the 11th ACM Conference on Computer and Communications Security, CCS 2004, 25–29 October 2004, Washington, DC, USA, pp. 132–145 (2004)

    Google Scholar 

  4. Brickell, E., Chen, L., Li, J.: A (Corrected) DAA scheme using batch proof and verification. In: Chen, L., Yung, M., Zhu, L. (eds.) INTRUST 2011. LNCS, vol. 7222, pp. 304–337. Springer, Heidelberg (2012)

    Google Scholar 

  5. Brickell, E., Li, J.: A pairing-based DAA scheme further reducing TPM resources. IACR Cryptology ePrint Archive 2010, 67 (2010)

    Google Scholar 

  6. Camenisch, J., Van Herreweghen, E.: Design and implementation of the idemix anonymous credential system. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, 18–22 November 2002, Washington, DC, USA, pp. 21–30 (2002)

    Google Scholar 

  7. Camenisch, J.L., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56–72. Springer, Heidelberg (2004)

    Google Scholar 

  8. Chen, L.: A DAA scheme requiring less TPM resources. In: Bao, F., Yung, M., Lin, D., Jing, J. (eds.) Inscrypt 2009. LNCS, vol. 6151, pp. 350–365. Springer, Heidelberg (2010)

    Google Scholar 

  9. Chen, L., Li, J.: Flexible and scalable digital signatures in TPM 2.0. In: 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, 4–8 November 2013, Berlin, Germany, pp. 37–48 (2013)

    Google Scholar 

  10. Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13–36. Springer, Heidelberg (2005)

    Google Scholar 

  11. Microsoft. U-prove cryptographic specification v1.1 (revision 3) (2014). http://research.microsoft.com/en-us/projects/u-prove

  12. Proudler, G., Chen, L., Dalton, C.: Trusted Computing Platforms - TPM2.0 in Context. Springer, Heidelberg (2014)

    Google Scholar 

  13. TCG. TPM main specification version 1.2 (2003). http://www.trustedcomputinggroup.org/resources/tpm_main_specification

  14. TCG. Trusted platform module library specification family 2.0 (2013). http://www.trustedcomputinggroup.org/resources/tpm_library_specification

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rainer Urian .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, L., Urian, R. (2015). DAA-A: Direct Anonymous Attestation with Attributes. In: Conti, M., Schunter, M., Askoxylakis, I. (eds) Trust and Trustworthy Computing. Trust 2015. Lecture Notes in Computer Science(), vol 9229. Springer, Cham. https://doi.org/10.1007/978-3-319-22846-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22846-4_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22845-7

  • Online ISBN: 978-3-319-22846-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics