Yin Hu
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.
- Jun Yang, Lan Gao, Youtao Zhang. Improving Memory Encryption Performance in Secure Processors. IEEE Transactions on Computers, VOL.54, NO. 5, MAY 2005 Google Scholar
Digital Library
- Ralph C. Merkle. Protocols for Public Key Cryptosystems. Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980.Google Scholar
- Chenyu Yan, Brian Rogers, Daniel Englender, Yan Solihin, Milos Prvulovic. Improving Cost, Performance, and Security of Memory Encryption and Authentication. ISCA '06. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- B. Gassend, G. E. Suh, D. Clarke, M. van Dijk, and S. Devadas, Caches and Hash Trees for Efficient Memory Integrity Verification, Proc. Ninth Int'l Symp. High Performance Computer Architecture (HPCA9), Feb. 2003. Google ScholarDigital Library
- D. Clarke, G. E. Suh, B. Gassend, A. Sudan, M. van Dijk and S. Devadas, Toward Constant Bandwidth Overhead Memory Integrity Verification, Proceedings of the IEEE Symposium on Security and Privacy, May 2005. Google ScholarDigital Library
- Ralph C. Merkle Secrecy, authentication, and public key systems Ph.D. thesis, Electrical Engineering, Stanford, 1979. Google ScholarDigital Library
- Mihir Bellare, Oded Goldreich, Shafi Goldwasser. Incremental Cryptography: The Case of Hashing and Signing In Advances in Cryptology -- CRYPTO'94, Lecture Notes in Computer Science, No. 839, pages 216--233. Springer-Verlag, 1994. Google ScholarDigital Library
- J. Black, S. Halevi, H. Krawczyk, T. Krovetz, P. Rogaway. UMAC: Fast and Secure Message Authentication. In Advances in Cryptology -- CRYPTO '99 Google ScholarDigital Library
- 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. DATE '05 Google ScholarDigital Library
- Jens-Peter Kaps, Kaan Yuksel, and Berk Sunar. Energy Scalable Universal Hashing. IEEE Transactions on Computers, volume 54, number 12, pages 1484--1495, December, 2005. Google ScholarDigital Library
- 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.Google Scholar
- M. Etzel, S. Patel, and Z. Ramzan. SQUARE HASH: Fast message authentication via optimized universal hash functions. In M. Wiener, editor, Advances in Cryptology -- CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 234--251, New York, 1999. Springer-Verlag. Google ScholarDigital Library
- S. Halevi and H. Krawczyk. MMH: Software message authentication in the gbit/second rates. In 4th Workshop on Fast Software Encryption, volume 1267 of Lecture Notes in Computer Science, pages 172--189. Springer, 1997. Google ScholarDigital Library
- J. M. Kahn, Katz R. H., and K. S. J. Pister. Next century challenges: mobile networking for 'smart dust'. In Proceedings of the fifth annual ACM/IEEE international conference on Mobile computing and networking, pages 271--278. ACM, 1999. Google ScholarDigital Library
- H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology -- CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 129--139. Springer-Verlag, 1994. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- Y. Mansour, N. Nissan, and P. Tiwari. The computational complexity of universal hashing. In 22nd Annual ACM Symposium on Theory of Computing, pages 235--243. ACM Press, 1990. Google ScholarDigital Library
- 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.Google Scholar
- V. Shoup. On fast and provably secure message authentication based on universal hashing. In Advances in Cryptology -- CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 74--85, New York, 1996. Springer-Verlag. Google ScholarDigital Library
- P. Rogaway. Bucket hashing and its application to fast message authetication. In D. Coppersmith, editor, Proceedings Crypto '95, volume 963 of LNCS, pages 29--42. Springer-Verlag, 1995. Google ScholarDigital Library
- J. L. Carter and M. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143--154, 1978.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- G. Hoglund and G. McGraw. Exploiting Online Games: Cheating Massively Distributed Systems. Addison-Wesley Professional, 2007. Google ScholarDigital Library
- David A. McGrew and John Viega The Galois/Counter Mode of Operation (GCM) Submission to NIST Modes of Operation Process, January, volume 15, 2004.Google Scholar
Index Terms
- A fast real-time memory authentication protocol
Recommendations
The BiBa one-time signature and broadcast authentication protocol
CCS '01: Proceedings of the 8th ACM conference on Computer and Communications SecurityWe introduce the BiBa signature scheme, a new signature construction that uses one-way functions without trapdoors. BiBa features a low verification overhead and a relatively small signature size. In comparison to other one-way function based signature ...
ID-Based Non-interactive Deniable Authentication Protocol
IAS '09: Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 01Non-interactive deniable authentication protocol is vulnerable to the receiver key-compromise impersonation attack, which are owing to the reason that the authentication message is computed from the receiver’s private and some other public values. ...
A Secure Strong-Password Authentication Protocol
Password authentication, which is widely used for authenticated method, also is important protocol by requiring a username and password before being allowed access to resources. In 2001, Lin et al. proposed the optimal strong-password authentication ...
Comments