Skip to main content
SpringerLink
Log in

A new process and framework for direct anonymous attestation based on symmetric bilinear maps

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

For the problem of the original direct anonymous attestation (DAA) scheme’s complexity and great time consumption, a new DAA scheme based on symmetric bilinear pairings is presented, which gives a practical solution to ECC-based TPM in protecting the privacy of the TPM. The scheme still includes five procedures or algorithms: Setup, Join, Sign, Verify and Rogue tagging, but gets rid of zero-knowledge proof and takes on a new process and framework, of which the main operations are addition, scalar multiplication and bilinear maps on supersingular elliptic curve systems. Moreover, the scheme adequately utilizes the properties of bilinear maps as well as the signature and verification of the ecliptic curve system itself. Compared with other schemes, the new DAA scheme not only satisfies the same properties, and shows better simplicity and high efficiency. This paper gives not only a detailed security proof of the proposed scheme, but also a careful performance analysis by comparing with the existing DAA schemes.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

  2. Trusted Computing Group Website [EB/OL]. [2011-03-20]. http://www.trustedcomputinggroup.org , 2010.

  3. Trusted Computing Group. TCG TPM specification 1.2 [EB/OL]. [2011-03-20]. http://www.trustedcomputinggroup.org .

  4. Ge H, Tate S R. A Direct anonymous attestation scheme for embedded devices[C]// Public Key Cryptography-PKC 2007 (LNCS 4450). New York: Springer-Verlag, 2007.

    Google Scholar 

  5. Brickell E, Li Jiangtao. 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. New York: ACM Press, 2007: 21–30..

    Google Scholar 

  6. Brickell E, Chen L, Li J. Simplified security notions for direct anonymous attestation and a concrete scheme from pairings [J]. Int Journal of Information Security, 2009, (8): 315–330.

  7. Brickell E, Chen L, Li J. A new direct anonymous attestation scheme from bilinear maps[C]//Trusted Computing-Challenges and Applications-TRUST 2008(LNCS 4968). New York: Springer-Verlag, 2008: 166–178.

    Google Scholar 

  8. Chen L, Morrissey P, Smart N P. Pairings in trusted computing[C]//Pairings in Cryptography-Pairing 2008(LNCS 5209). New York: Springer-Verlag, 2008: 1–17.

    Google Scholar 

  9. Chen L, Morrissey P, Smart N P. On proofs of security of DAA schemes[C]//Provable Security-ProvSec 2008. New York: Springer-Verlag, 2008: 167–175.

    Google Scholar 

  10. Chen L, Morrissey P, Smart N P. DAA: Fixing the pairing based protocols (Cryptology ePrint Archive Report) [R/OL]. [2009-09-08]. http://eprint.iacr.org/2009/198.

  11. Chen L, Li J. A note on the Chen-Morrissey-Smart Direct Anonymous Attestation scheme [J]. Information Processing Letters, 2010, 110(12–13): 485–488.

    Article  MathSciNet  Google Scholar 

  12. Brickell E, Li J. Enhanced privacy ID from bilinear pairing (Cryptology ePrint Archive Report) [R/OL]. [2009-09-05]. http://eprint.iacr.org/2009/09.

  13. Chen X, Feng D. Direct anonymous attestation for next generation TPM[J]. Journal of Computers, 2008, 3(12): 43–50.

    MathSciNet  Google Scholar 

  14. Brickell E, Li Jiangtao. A pairing-based DAA scheme further reducing TPM resources[J]. Trust and Trustworthy Computing, 2010, 6101: 181–195.

    Article  Google Scholar 

  15. Zhen Honghu, Chen Yue. Bilinear pairing based DAA protocol[C] //International Conference on Computational Intelligence and Natural Computing. New York: Springer-Verlag, 2009: 466–469.

    Chapter  Google Scholar 

  16. Boneh D, Franklin M. Identity-based encryption from the Weil pairing[C]// Proceedings of CRYPTO 2001(LNCS 2139). Heidelberg: Springer-Verlag, 2001: 213–229.

    Google Scholar 

  17. Camenisch J, Lysyanskaya A. Signature schemes and anonymous credentials from bilinear maps[C]// Proceedings of CRYPTO 2004(LNCS 3152). Heidelberg: Springer-Verlag, 2004: 56–72.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer/Key Lab of Visualization in Scientific Computing and Virtual Reality of Sichuan, Sichuan Normal University, Chengdu, 610066, Sichuan, China

    Liang Tan

  2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100190, China

    Liang Tan

  3. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, Sichuan, China

    Mingtian Zhou

Authors
  1. Liang Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingtian Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liang Tan.

Additional information

Foundation item: Supported by the National Natural Science Foundation of China (60970113) and Sichuan Youth Science and Technology Foundation (2011JQ0038)

Biography: TAN Liang, Ph.D., Professor, research direction: trusted computing, network security.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tan, L., Zhou, M. A new process and framework for direct anonymous attestation based on symmetric bilinear maps. Wuhan Univ. J. Nat. Sci. 16, 369–375 (2011). https://doi.org/10.1007/s11859-011-0765-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-011-0765-4

Key words

CLC number

Search

Navigation