Paper 2017/506

Optimal Overcoming Weak Expectations

Maciej Skorski

Abstract

Barak et al. (CRYPTO'11) initiated the study of so called square-friendly applications which offer good security for keys with entropy deficiency (weak keys), for this reason being important for key derivation. The state of the art of security bounds was established by Dodis and Yu (TCC'13), by modeling "weak" keys as distributions of high collision entropy. In this paper we answer the question what is the minimum requirement on weak keys to be "good" for these applications. The answer gives an elegant operational meaning to the notion of smooth collision entropy. Namely, smooth collision entropy is both sufficient and necessary (with essentially the same entropy parameters) to guarantee the security of square-friendly applications under weak keys. This characterization is a consequence of constrained optimization techniques.

Note: this paper has an error in the proof. similar claims with correct proofs are part of another paper "Pseudorandomness Against Mean and Variance Bounded Attackers"

Metadata
Available format(s)
-- withdrawn --
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
key derivationsquare-friendly applicationsweak expectationssmooth entropy
Contact author(s)
maciej skorski @ gmail com
History
2018-10-12: withdrawn
2017-06-02: received
See all versions
Short URL
https://ia.cr/2017/506
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.