International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A Simple and Unified Method of Proving Unpredictability

Authors:
Mridul Nandi
Download:
URL: http://eprint.iacr.org/2006/264
Search ePrint
Search Google
Abstract: Recently Bernstein has provided a simpler proof of unpredictability of CBC construction which is giving insight of the construction. Unpredictability of any function intuitively means that the function behaves very closely to a uniform random function. In this paper we make a unifying and simple approach to prove unpredictability of many existing constructions. We first revisit Bernstein's proof. Using this idea we can show a simpler proof of unpredictability of a class of DAG based construction, XCBC, TMAC, OMAC and PMAC. We also provide a simpler proof for stronger bound of CBC and a simpler proof of security of on-line Hash-CBC. We note that there is a flaw in the original security proof of Hash-CBC. This paper will help to understand security analysis of unpredictability of many constructions in a simpler way.
BibTeX
@misc{eprint-2006-21756,
  title={A Simple and Unified Method of Proving Unpredictability},
  booktitle={IACR Eprint archive},
  keywords={},
  url={http://eprint.iacr.org/2006/264},
  note={ mridul.nandi@gmail.com 13363 received 3 Aug 2006},
  author={Mridul Nandi},
  year=2006
}