arXiv, first posted Feb 2019, most recently updated Aug 2019: https://arxiv.org/abs/1902.11202

Publisher's Version: https://link.springer.com/chapter/10.1007%2F978-3-030-26951-7_28

We introduce *hardness in relative entropy*, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies both *next-block pseudoentropy* and *inaccessible entropy*, two forms of computational entropy used in recent constructions of pseudorandom generators and statistically hiding commitment schemes, respectively. Thus, hardness in relative entropy unifies the latter two notions of computational entropy and sheds light on the apparent “duality” between them. Additionally, it yields a more modular and illuminating proof that one-way functions imply next-block inaccessible entropy, similar in structure to the proof that one-way functions imply next-block pseudoentropy (Vadhan and Zheng, STOC ‘12).

%B Advances in Cryptology: CRYPTO 2019, A. Boldyreva and D. Micciancio, (Eds)
%I Springer Verlag, Lecture Notes in Computer Science
%V 11693
%P 831-858
%G eng
%U https://link.springer.com/chapter/10.1007%2F978-3-030-26951-7_28
%N 1902.11202 [cs.CR]