Cryptology ePrint Archive: Report 2006/221

Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem

Phillip Rogaway and Thomas Shrimpton

Abstract: Standards bodies have been addressing the key-wrap problem, a cryptographic goal that has never received a provable-security treatment. In response, we provide one, giving definitions, constructions, and proofs. We suggest that key-wrap’s goal is security in the sense of deterministic authenticated-encryption (DAE), a notion that we put forward. We also provide an alternative notion, a pseudorandom injection (PRI), which we prove to be equivalent. We provide a DAE construction, SIV, analyze its concrete security, develop a blockcipher-based instantiation of it, and suggest that the method makes a desirable alternative to the schemes of the X9.102 draft standard. The construction incorporates a method to turn a PRF that operates on a string into an equally efficient PRF that operates on a vector of strings, a problem of independent interest. Finally, we consider IV-based authenticated- encryption (AE) schemes that are maximally forgiving of repeated IVs, a goal we formalize as misuse-resistant AE.We show that a DAE scheme with a vector-valued header, such as SIV, directly realizes this goal.

Category / Keywords: Authenticated encryption, cryptographic definitions, cryptographic standards, key wrapping

Publication Info: An abridged version appeared at Eurocrypt 2006. This is the full version.

Date: received 30 Jun 2006, last revised 20 Aug 2007

Contact author: teshrim at cs pdx edu

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: retitled 9/06

Version: 20070820:090426 (All versions of this report)

Discussion forum: Show discussion | Start new discussion