Some Notions of Entropy for Cryptography
This paper presents a brief and (necessarily) incomplete survey of some notions of entropy that have been recently used in the analysis of cryptographic constructions. It focuses on min-entropy and its extensions to the cases when
the adversary has correlated information and/or is computationally bounded.
It also presents results that can be used to bound such entropy
and apply it to the analysis of cryptographic constructions.
The paper (a slightly older version) and talk were presented at Information Theoretic Security - 5th International Conference, ICITS 2011, Amsterdam, The Netherlands, May 21-24, 2011, Springer LNCS 6672, Serge Fehr, editor, pp. 138-142. © by the author.