Paper 2006/433 Original: eprint.iacr.org/2006/433 ↗
Information Theoretic Bounds on Authentication Systems in Query Model
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2006-11-21: last updated
- 2006-11-21: published
- Short URL
- https://ia.cr/2006/433
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/433,
author = {Reihaneh Safavi-Naini and Peter Wild},
title = {Information Theoretic Bounds on Authentication Systems in Query Model},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/433},
year = {2006},
url = {https://eprint.iacr.org/2006/433}
}