CryptoDB
Information Theoretic Bounds on Authentication Systems in Query Model
Authors: | |
---|---|
Download: | |
Abstract: | Authentication codes provide message integrity guarantees in an information theoretic sense within a symmetric key setting. Information theoretic bounds on the success probability of an adversary who has access to previously authenticated messages have been derived by Simmons and Rosenbaum, among others. In this paper we consider a strong attack scenario where the adversary is adaptive and has access to authentication and verification oracles. We derive information theoretic bounds on the success probability of the adversary and on the key size of the code. This brings the study of unconditionally secure authentication systems on a par with the study of computationally secure ones. We characterize the codes that meet these bounds and compare our result with the earlier ones. |
BibTeX
@misc{eprint-2006-21924, title={Information Theoretic Bounds on Authentication Systems in Query Model}, booktitle={IACR Eprint archive}, keywords={foundations / information theory, message authentication, authentication codes}, url={http://eprint.iacr.org/2006/433}, note={ rei@uow.edu.au 13472 received 20 Nov 2006}, author={Reihaneh Safavi-Naini and Peter Wild}, year=2006 }