A fast real-time memory authentication protocol

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A fast real-time memory authentication protocol

Full text

Pdf (423 KB)

Source

Conference on Computer and Communications Security archive
Proceedings of the 3rd ACM workshop on Scalable trusted computing table of contents

Alexandria, Virginia, USA

SESSION: Trusted computing building blocks table of contents

Pages 31-40

Year of Publication: 2008

ISBN:978-1-60558-295-5

Authors

Yin Hu	Worcester Polytechnic Institute, Worcester, MA, USA
Ghaith Hammouri	Worcester Polytechnic Institute, Worcester, MA, USA
Berk Sunar	Worcester Polytechnic Institute, Worcester, MA, USA

Sponsors

ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1456455.1456461 What is a DOI?

ABSTRACT

We propose a new real-time authentication scheme for memory. As in previous proposals the scheme uses a Merkle tree to guarantee dynamic protection of memory. We use the universal hash function family NH for speed and couple it with an AES encryption in order to achieve a high level of security. The proposed scheme is much faster compared to similar schemes achieved by cryptographic hash functions such as SHA-1 due to the finer grain incremental hashing ability provided by NH. This advantage in speed becomes more vivid when the frequency of integrity checks becomes much lower than the frequency of memory updating. This feature is mainly due to the incremental nature of NH. Moreover, we show that with a small variation in the universal hash function family used, we can achieve fast and simple software implementation.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Jun Yang , Lan Gao , Youtao Zhang, Improving Memory Encryption Performance in Secure Processors, IEEE Transactions on Computers, v.54 n.5, p.630-640, May 2005 [doi>10.1109/TC.2005.80]
	2	Ralph C. Merkle. Protocols for Public Key Cryptosystems. Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980.
	3	Chenyu Yan , Daniel Englender , Milos Prvulovic , Brian Rogers , Yan Solihin, Improving Cost, Performance, and Security of Memory Encryption and Authentication, Proceedings of the 33rd annual international symposium on Computer Architecture, p.179-190, June 17-21, 2006
	4	D. Clarke, S. Devadas, B. Gassend, M. van Dijk, and G. E. Suh, Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking, Proceedings of the 2003 Asiacrypt Conference, November 2003.
	5	Blaise Gassend , G. Edward Suh , Dwaine Clarke , Marten van Dijk , Srinivas Devadas, Caches and Hash Trees for Efficient Memory Integrity Verification, Proceedings of the 9th International Symposium on High-Performance Computer Architecture, p.295, February 08-12, 2003
	6	Dwaine Clarke , G. Edward Suh , Blaise Gassend , Ajay Sudan , Marten van Dijk , Srinivas Devadas, Towards Constant Bandwidth Overhead Integrity Checking of Untrusted Data, Proceedings of the 2005 IEEE Symposium on Security and Privacy, p.139-153, May 08-11, 2005
	7	Ralph Charles Merkle, Secrecy, authentication, and public key systems., Stanford University, Stanford, CA, 1979
	8	Mihir Bellare , Oded Goldreich , Shafi Goldwasser, Incremental Cryptography: The Case of Hashing and Signing, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.216-233, August 21-25, 1994
	9	John Black , Shai Halevi , Hugo Krawczyk , Ted Krovetz , Phillip Rogaway, UMAC: Fast and Secure Message Authentication, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.216-233, August 15-19, 1999
	10	R. Elbaz , L. Torres , G. Sassatelli , P. Guillemin , C. Anguille , M. Bardouillet , C. Buatois , J. B. Rigaud, Hardware Engines for Bus Encryption: A Survey of Existing Techniques, Proceedings of the conference on Design, Automation and Test in Europe, p.40-45, March 07-11, 2005 [doi>10.1109/DATE.2005.170]
	11	Jens-Peter Kaps , Kaan Yuksel , Berk Sunar, Energy Scalable Universal Hashing, IEEE Transactions on Computers, v.54 n.12, p.1484-1495, December 2005 [doi>10.1109/TC.2005.195]
	12	G. Brassard. On computationally secure authentication tags requiring short secret shared keys. In D. Chaum, R. L. Rivest, and A. T. Sherman, editors, Advances in Cryptology -- CRYPTO '82, Lecture Notes in Computer Science, pages 79--86, New York, 1983. Springer-Verlag.
	13	Mark Etzel , Sarvar Patel , Zulfikar Ramzan, SQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.234-251, August 15-19, 1999
	14	Shai Halevi , Hugo Krawczyk, MMH: Software Message Authentication in the Gbit/Second Rates, Proceedings of the 4th International Workshop on Fast Software Encryption, p.172-189, January 20-22, 1997
	15	J. M. Kahn , R. H. Katz , K. S. J. Pister, Next century challenges: mobile networking for “Smart Dust”, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.271-278, August 15-19, 1999, Seattle, Washington, United States [doi>10.1145/313451.313558]
	16	Hugo Krawczyk, LFSR-based Hashing and Authentication, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.129-139, August 21-25, 1994
	17	H. Krawczyk. New hash functions for message authentication. In EUROCRYPT'95, volume 921 of Lecture Notes in Computer Science, pages 301--310. Springer-Verlag, 1995.
	18	Y. Mansour , N. Nisan , P. Tiwari, The computational complexity of universal hashing, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.235-243, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100246]
	19	W. Nevelsteen and B. Preneel. Software performance of universal hash functions. In EUROCRYPT'99, volume 1592 of Lecture Notes in Computer Science, pages 24--41, Berlin, 1999. Springer-Verlag.
	20	Victor Shoup, On Fast and Provably Secure Message Authentication Based on Universal Hashing, Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, p.313-328, August 18-22, 1996
	21	Phillip Rogaway, Bucket Hashing and its Application to Fast Message Authentication, Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.29-42, August 27-31, 1995
	22	J. L. Carter and M. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143--154, 1978.
	23	J. L. Carter and M. Wegman. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22:265--279, 1981.
	24	Greg Hoglund , Gary McGraw, Exploiting online games: cheating massively distributed systems, Addison-Wesley Professional, 2007
	25	David A. McGrew and John Viega The Galois/Counter Mode of Operation (GCM) Submission to NIST Modes of Operation Process, January, volume 15, 2004.