Anonymous Symmetric-Key Communication
Fabio Banfi and Ueli Maurer
We study anonymity of probabilistic encryption (pE) and probabilistic authenticated encryption (pAE). We start by providing concise game-based security definitions capturing anonymity for both pE and pAE, and then show that the commonly used notion of indistinguishability from random ciphertexts ($\text{IND\$}$) indeed implies the anonymity notions for both pE and pAE. This is in contrast to a recent work of Chan and Rogaway (Asiacrypt 2019), where it is shown that $\text{IND\$}$-secure nonce-based authenticated encryption can only achieve anonymity if a sophisticated transformation is applied. Moreover, we also show that the Encrypt-then-MAC paradigm is anonymity-preserving, in the sense that if both the underlying probabilistic MAC (pMAC) and pE schemes are anonymous, then also the resulting pAE scheme is. Finally, we provide a composable treatment of anonymity using the constructive cryptography framework of Maurer and Renner (ICS 2011). We introduce adequate abstractions modeling various kinds of anonymous communication channels for many senders and one receiver in the presence of an active man-in-the-middle adversary. Then we show that the game-based notions indeed are anonymity-preserving, in the sense that they imply constructions between such anonymous channels, thus generating authenticity and/or confidentiality as expected, but crucially retaining anonymity if present.
BibTeX Citation
@inproceedings{BanMau20,
author = {Fabio Banfi and Ueli Maurer},
title = {Anonymous Symmetric-Key Communication},
editor = {Galdi, Clemente and Kolesnikov, Vladimir},
booktitle = {Security and Cryptography for Networks -- SCN 2020},
pages = {471--491},
series = {LNCS},
volume = {12238},
year = {2020},
month = {9},
publisher = {Springer},
}