Security considerations for incremental hash functions based on pair block chaining

Raphael C.W. Phan, David Wagner

Research output: Contribution to journalArticleResearchpeer-review

20 Citations (Scopus)


Incremental hash functions have gained much attention due to their incremental property, i.e. hashes of updated messages can be speedily computed from previous hashes without having to re-hash the message as was the case in conventional hash functions. In this paper, we first show how collisions can be obtained in such incremental hash functions that are based on pair block chaining, highlighting that more caution should be taken into its design process. We then identify some design and implementation criteria for such incremental hash functions.

Original languageEnglish
Pages (from-to)131-136
Number of pages6
JournalComputers & Security
Issue number2
Publication statusPublished - Mar 2006
Externally publishedYes


  • Collision resistance
  • Cryptography
  • Hash function
  • Incremental cryptography
  • Pair block chaining

Cite this