Cryptology ePrint Archive: Report 2015/485
Turning Online Ciphers Off
Elena Andreeva and Guy Barwell and Ritam Bhaumik and Mridul Nandi and Dan Page and Martijn Stam
Abstract: CAESAR has caused a heated discussion regarding the merits of one-pass encryption and online ciphers. The latter is a keyed, length preserving function which outputs ciphertext blocks as soon as the respective plaintext block is available as input. The immediacy of an online cipher gives a clear performance advantage, yet it comes at a price. Since ciphertext blocks cannot depend on later plaintext blocks, diffusion and hence security is limited. We show how one can attain the best of both worlds by providing provably secure constructions, achieving full cipher security, based on applications of an online cipher around blockwise reordering layers.
Explicitly, we show that with just two calls to the online cipher, PRP security up to the birthday bound is both attainable and maximal. Moreover, we demonstrate that three calls to the online cipher suffice to obtain beyond birthday bound security. We provide a full proof of this for a PRP construction, and, in the ąPRP setting, security
against adversaries who make queries of any single length. As part of our investigation, we extend an observation by Rogaway and Zhang by further highlighting the close relationship between online ciphers and tweakable blockciphers with variable-length tweaks.
Category / Keywords: beyond birthday bound, online ciphers, modes of operation, provable security, pseudorandom permutation, tweakable blockcipher
Date: received 21 May 2015, last revised 3 Sep 2016
Contact author: guy barwell+TOCO at bristol ac uk
Available format(s): PDF | BibTeX Citation
Version: 20160903:182510 (All versions of this report)
Short URL: ia.cr/2015/485
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]