A Single-Key Domain Extender for Privacy-Preserving MACs and PRFs

  • Authors:
  • Kan Yasuda

  • Affiliations:
  • NTT Information Sharing Platform Laboratories, NTT Corporation, Tokyo, Japan 180-8585

  • Venue:
  • Information Security and Cryptology --- ICISC 2008
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a CBC (cipher block chaining)-like mode of operation for MACs (message authentication codes) using a hash function. The new construction iCBC (imbalanced CBC) does not follow the Merkle-Damgård design but rather iterates the underlying compression function directly in a CBC-like manner. Many of the prior MAC constructions, including HMAC, assume PRF (pseudo-random function) properties of the underlying primitive. In contrast, our iCBC-MAC makes only a PP-MAC (privacy-preserving MAC) assumption about the compression function. Despite the fact that PP-MAC is a strictly weaker requirement than PRF, iCBC-MAC works with a single key like HMAC and runs as efficiently as HMAC. Moreover, iCBC-MAC becomes even faster than HMAC, depending on the choice of security parameters. Additionally, iCBC-MAC is multi-property-preserving in the sense that it operates as a domain extender for both PP-MACs and PRFs.