### Simplifying Game-Based Definitions: Indistinguishability up to Correctness and Its Application to Stateful AE

Phillip Rogaway and Yusi Zhang

##### Abstract

Often the simplest way of specifying game-based cryptographic definitions is apparently barred because the adversary would have some trivial win. Disallowing or invalidating these wins can lead to complex or unconvincing definitions. We suggest a generic way around this difficulty. We call it indistinguishability up to correctness, or IND|C. Given games G and H and a correctness condition C we define an advantage measure Adv_{G,H,C}^indc wherein G/H distinguishing attacks are effaced to the extent that they are inevitable due to C. We formalize this in the language of oracle silencing, an alternative to exclusion-style and penalty-style definitions. We apply our ideas to a domain where game-based definitions have been cumbersome: stateful authenticated-encryption (sAE). We rework existing sAE notions and encompass new ones, like replay-free AE permitting a specified degree of out-of-order message delivery.

Available format(s)
Publication info
Keywords
indistinguishabilityoracle silencingprovable securitystateful authenticated encryption
Contact author(s)
rogaway @ cs ucdavis edu
ysizhang @ ucdavis edu
History
Short URL
https://ia.cr/2018/558

CC BY

BibTeX

@misc{cryptoeprint:2018/558,
author = {Phillip Rogaway and Yusi Zhang},
title = {Simplifying Game-Based Definitions: Indistinguishability up to Correctness and Its Application to Stateful AE},
howpublished = {Cryptology ePrint Archive, Paper 2018/558},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/558}},
url = {https://eprint.iacr.org/2018/558}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.