Skip to main content

Coded Circuit for Trusted Computing: Towards Dynamic Integrity Measurement

  • Conference paper
  • 1582 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 227))

Abstract

Trusted computing is a new requirement of information security, after the successful modern cryptography. Measuring a computing objects or unit to reveal its trust status is the core of trusted computing. Although there are many developments of methods and techniques to address on the problems of measure, especially dynamic measurement, the lack of rigorous theoretic treatment makes it hard to give further mathematical treatment. In this paper, we introduce concepts of trusted computing founded on computational complexity, trust pair and coded circuit, based on which, we give a method to measure the dynamic status of a computing coded circuit.

This work is supported by Fujian Provincial Natural Science Foundation, #2010J01283.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, R.: Cryptography and Competition Policy - Issues with ‘Trusted Computing. In: Jajodia, S., Camp, L., Lewis, S. (eds.) Advances in Information Security, vol. 12, pp. 35–52. Springer US, Heidelberg (2004)

    Google Scholar 

  2. Hao, W., Guoqing, W.: On the Concept of Trusted Computing and Software Watermarking: A Computational Complexity Treatise (2010) (to appear)

    Google Scholar 

  3. Huanguo, Z., Jie, L., Gang, J., Zhiqiang, Z., Fajiang, Y., Fei, Y.: Development of trusted computing research, vol. 11, pp. 1407–1413. Wuhan University, co-published with Springer (2006)

    Google Scholar 

  4. Gallery, E., Mitchell, C.J.: Trusted Computing: Security and Applications. Cryptologia 33, 217–245 (2009)

    Article  Google Scholar 

  5. Sailer, R., Zhang, X., Jaeger, T., van Doorn, L.: Design and implementation of a TCG-based integrity measurement architecture. In: SSYM 2004, Berkeley, CA, USA, pp. 16–16 (2004)

    Google Scholar 

  6. Wegener, I.: The complexity of Boolean functions. John Wiley & Sons, Inc., New York (1987)

    MATH  Google Scholar 

  7. Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York (2009)

    Book  MATH  Google Scholar 

  8. Nerode, A., Shore, R.A.: Logic for Applications. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  9. Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, New York (2000)

    MATH  Google Scholar 

  10. Denning, D.E.: An Intrusion-Detection Model. IEEE Transactions on Software Engineering SE-13, 222–232 ,198

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hao, W., Guoqing, W. (2011). Coded Circuit for Trusted Computing: Towards Dynamic Integrity Measurement. In: Zhang, J. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23226-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23226-8_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23225-1

  • Online ISBN: 978-3-642-23226-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics