Paper 2011/644 Original: eprint.iacr.org/2011/644 ↗

McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes

Ewan Fleischmann
Christian Forler
Stefan Lucks
Jakob Wenzel
Abstract

On-Line Authenticated Encryption (OAE) combines privacy with data integrity and is on-line computable. Most block cipher-based schemes for Authenticated Encryption can be run on-line and are provably secure against nonce-respecting adversaries. But they fail badly for more general adversaries. This is not a theoretical observation only --~in practice, the reuse of nonces is a frequent issue. In recent years, cryptographers developed misuse resistant schemes for Authenticated Encryption. These guarantee excellent security even against general adversaries which are allowed to reuse nonces. Their disadvantage is that encryption can be performed in an off-line way, only. This paper introduces a new family of OAE schemes --called McOE -- dealing both with nonce-respecting and with general adversaries. Furthermore, we present two family members, i.e., McOE-X and McOE-G. They are based on a 'simple' block cipher. In contrast to every other OAE scheme known in literature, they provably guarantee reasonable security against general adversaries as well as standard security against nonce-respecting adversaries.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
History
2013-12-13: last updated
2011-11-30: published
Short URL
https://ia.cr/2011/644
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2011/644,
      author = {Ewan Fleischmann and Christian Forler and Stefan Lucks and Jakob Wenzel},
      title = {McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/644},
      year = {2011},
      url = {https://eprint.iacr.org/2011/644}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.