Skip to main content

An Improved Memory Integrity Protection Scheme

  • Conference paper
Trust and Trustworthy Computing (Trust 2010)

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

Included in the following conference series:

Abstract

In this paper, we proposed an improved memory integrity protection scheme to provide real-time protection service. In addition, we for the first time propose a provably secure scheme that takes advantage of the “error inheritance” property, which can minimize the costly check process that is normally required before every access. The security of the proposed scheme is rigorously analyzed and the performance is measured. The peak performance of the new scheme can be improved by up to a factor of 5 over a previously proposed scheme based on Merkle Trees.

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

Access this chapter

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Merkle, R.C.: Protocols for Public Key Cryptosystems. In: Proceedings of the 1980 IEEE Symposium on Security and Privacy (1980)

    Google Scholar 

  2. Yan, C., Rogers, B., Englender, D., Solihin, Y., Prvulovic, M.: Improving Cost, Performance, and Security of Memory Encryption and Authentication. In: ISCA 2006 (2006)

    Google Scholar 

  3. Clarke, D., Suh, G.E., Gassend, B., Sudan, A., van Dijk, M., Devadas, S.: Toward Constant Bandwidth Overhead Memory Integrity Verification. In: Proceedings of the IEEE Symposium on Security and Privacy (May 2005)

    Google Scholar 

  4. Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: Fast and Secure Message Authentication. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 216. Springer, Heidelberg (1999)

    Google Scholar 

  5. Nevelsteen, W., Preneel, B.: Software performance of universal hash functions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 24–41. Springer, Heidelberg (1999)

    Google Scholar 

  6. Hu, Y., Hammouri, G., Sunar, B.: A Fast Real-time Memory Authentication Protocol. In: Proc. of STC 2008 (2008)

    Google Scholar 

  7. Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 129–139. Springer, Heidelberg (1994)

    Google Scholar 

  8. Kaps, J.-P., Yuksel, K., Sunar, B.: Energy Scalable Universal Hashing. IEEE Transactions on Computers 54(12), 1484–1495 (2005)

    Article  Google Scholar 

  9. Handschuh, H., Preneel, B.: Key-recovery attacks on universal hash function based MAC algorithms. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 144–161. Springer, Heidelberg (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, Y., Sunar, B. (2010). An Improved Memory Integrity Protection Scheme. In: Acquisti, A., Smith, S.W., Sadeghi, AR. (eds) Trust and Trustworthy Computing. Trust 2010. Lecture Notes in Computer Science, vol 6101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13869-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13869-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13868-3

  • Online ISBN: 978-3-642-13869-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics