Overcoming weak expectations

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Recently, there has been renewed interest in basing cryptographic primitives on weak secrets, where the only information about the secret is some non-trivial amount of (min-) entropy. From a formal point of view, such results require to upper bound the expectation of some function f(X), where X is a weak source in question. We show an elementary inequality which essentially upper bounds such 'weak expectation' by two terms, the first of which is independent of f, while the second only depends on the 'variance' of f under uniform distribution. Quite remarkably, as relatively simple corollaries of this elementary inequality, we obtain some 'unexpected' results, in several cases noticeably simplifying/improving prior techniques for the same problem. Examples include non-malleable extractors, leakage-resilient symmetric encryption, seed-dependent condensers and improved entropy loss for the leftover hash lemma.

Original languageEnglish (US)
Title of host publication2012 IEEE Information Theory Workshop, ITW 2012
Pages109-113
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE Information Theory Workshop, ITW 2012 - Lausanne, Switzerland
Duration: Sep 3 2012Sep 7 2012

Publication series

Name2012 IEEE Information Theory Workshop, ITW 2012

Other

Other2012 IEEE Information Theory Workshop, ITW 2012
CountrySwitzerland
CityLausanne
Period9/3/129/7/12

ASJC Scopus subject areas

  • Information Systems

Fingerprint Dive into the research topics of 'Overcoming weak expectations'. Together they form a unique fingerprint.

  • Cite this

    Dodis, Y., & Yu, Y. (2012). Overcoming weak expectations. In 2012 IEEE Information Theory Workshop, ITW 2012 (pp. 109-113). [6404636] (2012 IEEE Information Theory Workshop, ITW 2012). https://doi.org/10.1109/ITW.2012.6404636