Entropic security and the encryption of high entropy messages (2005)
| Venue: | In Theory of Cryptography Conference (TCC) ’05 |
| Citations: | 14 - 4 self |
BibTeX
@INPROCEEDINGS{Dodis05entropicsecurity,
author = {Yevgeniy Dodis},
title = {Entropic security and the encryption of high entropy messages},
booktitle = {In Theory of Cryptography Conference (TCC) ’05},
year = {2005},
pages = {556--577},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract Russell and Wang [22] recently introduced an elegant, information-theoretic notion calledentropic security of encryption: they required that the cipher text leak no predicate of the plaintext (similar to semantic security [10]) but only as long as the distribution on messageshas high entropy from the adversary's point of view. They show that this notion of security can be achieved with very short keys for entropically rich message spaces. Canetti et al [6, 7] hadpreviously constructed hash functions which satisfy a similar entropic security condition. The output of such hash function leaks no partial information about the input, provided the inputhas sufficiently high entropy. This paper studies entropic security in general, and its application to the encryption ofhigh-entropy messages. * We elucidate the notion of entropic security. Our results apply to all entropically-secureprimitives, including both encryption and hash functions. We strengthen the formulation
