Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 188-207
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Efficient memory integrity verification and encryption for secure processors2003
- Incremental Cryptography: The Case of Hashing and Signing2001
- A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost1997
- Generating hard instances of lattice problems (extended abstract)1996
- XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions1995
- Checking the correctness of memoriesAlgorithmica, 1994
- Random oracles are practical1993
- The MD5 Message-Digest Algorithm1992
- Small-bias probability spaces: efficient constructions and applications1990
- How to construct random functionsJournal of the ACM, 1986