Linking Online Misuse-Resistant Authenticated Encryption and Blockwise Attack Models

Authors

  • Guillaume Endignoux École polytechnique fédérale de Lausanne (EPFL), Lausanne, Switzerland
  • Damian Vizár École polytechnique fédérale de Lausanne (EPFL), Lausanne, Switzerland

DOI:

https://doi.org/10.13154/tosc.v2016.i2.125-144

Keywords:

Symmetric-key Cryptography, Authenticated Encryption, Online Encryption, Security Notions

Abstract

Real-world applications of authenticated encryption often require the encryption to be computable online, e.g. to compute the ith block of ciphertext after having processed the first i blocks of plaintext. A significant line of research was dedicated to identifying security notions for online authenticated encryption schemes, that capture various security goals related to real-life scenarios. Fouque, Joux, Martinet and Valette proposed definitions of privacy and integrity against adversaries that can query their oracles in a blockwise-adaptive manner, to model memory-constrained applications. A decade later, Fleischmann, Forler and Lucks proposed the notion of online nonce misuse-resistant authenticated encryption (OAE) to capture the security of online authenticated encryption under nonce-reuse. In this work we investigate the relation between these notions. We first recast the blockwise notions of Fouque et al. to make them compatible with online authenticated encryption schemes that support headers. We then show that OAE and the conjunction of the blockwise notions are “almost” equivalent. We identify the missing property on the side of blockwise notions, and formalize it under the name PR-TAG. With PR-TAG being just an auxiliary definition, the equivalence we finally show suggests that OAE and the blockwise model for online authenticated encryption capture essentially the same notion of security.

Downloads

Published

2017-02-03

Issue

Section

Articles

How to Cite

Linking Online Misuse-Resistant Authenticated Encryption and Blockwise Attack Models. (2017). IACR Transactions on Symmetric Cryptology, 2016(2), 125-144. https://doi.org/10.13154/tosc.v2016.i2.125-144