Incremental multiset hash functions and their application to memory integrity checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2894, Issue , 2003, Pages 188-207

  Clarke, Dwaine ^a   Devadas, Srinivas ^a   Van Dijk, Marten ^a   Gassend, Blaise ^a   Suh, G Edward ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Incremental cryptography; Memory integrity checking; Multiset hash functions; Multiset collision resistance; Set collision resistance

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

ACTIVE ADVERSARY; COLLISION RESISTANCE; FINITE SIZE; INTEGRITY CHECKING; MULTI-SETS; MULTISET; NEW MEMBERS; TIME STAMPS;

HASH FUNCTIONS;

EID: 0345490611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40061-5_12     Document Type: Article

References (14)

1. M. Ajtai. Generating hard instances of lattice problems. In 28th ACM STOC, pages 99-108, 1996.
2. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: The case of hashing and signing. In Crypto '94, LNCS 839. Springer-Verlag, 1994.
3. M. Bellare, R. Guerin, and P. Rogaway. XOR MACs: New methods for message authentication using finite pseudorandom functions. In Crypto '95, LNCS 963. Springer-Verlag, 1995.
4. M. Bellare and D. Micciancio. A new paradigm for collision-free hashing: Incrementality at reduced cost. In Eurocrypt '97, LNCS 1233. Springer-Verlag, 1997.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM CCS '93, pages 62-73. ACM Press, 1993.
6. M. Blum, W. S. Evans, P. Gemmell, S. Kannan, and M. Naor. Checking the correctness of memories. In Algorithmica, volume 12, pages 225-244, 1994.
7. D. Clarke, B. Gassend, G. E. Suh, M. van Dijk, and S. Devadas. Offline integrity checking of untrusted storage. In MIT-LCS-TR-871, Nov. 2002.
8. O. Goldreich, S. Goldwasser, and S. Halevi. Collision-free hashing from lattice problems. In Theory of Cryptography Library 96-09, July 1996.
9. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):210-217, 1986.
10. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In 22nd ACM STOC, pages 213-223, 1990.
11. NIST. FIPS PUB 180-1: Secure Hash Standard, April 1995.
12. R. Rivest. RFC 1321: The MD5 Message-Digest Algorithm, April 1992.
13. th Int'l Conference on Supercomputing, June 2003.
14. th Int'l Symposium on Microarchitecture, Dec 2003.