Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking

We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). They map multisets of arbitrary finite size to strings (hashes) of fixed length. They are incremental in that, when new members are added to the multiset, the hash can be updated in time proportional to the change. The functions may be multiset-collision resistant in that it is difficult to find two multisets which produce the same hash, or just set-collision resistant in that it is difficult to find a set and a multiset which produce the same hash. In particular, we introduce four multiset hash functions, each with its own advantages. MSet-XOR-Hash uses the XOR operation and is very efficient; however, it uses a secret key and is only set-collision resistant. MSet-Add-Hash uses addition modulo a large integer and, thus, is slightly less efficient than MSet-XOR-Hash; MSet-Add-Hash also uses a secret key b...

• Type: Conference
• Year: 2003
• Where: ASIACRYPT
• Authors: Dwaine E. Clarke, Srinivas Devadas, Marten van Dijk, Blaise Gassend, G. Edward Suh
• Keywords: ASIACRYPT 2003, Cryptology, Hash Functions, Multiset Hash Functions, Multiset-collision Resistant