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

Other

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

Fingerprint

Entropy
Cryptography
Seed

ASJC Scopus subject areas

  • Information Systems

Cite this

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

Overcoming weak expectations. / Dodis, Yevgeniy; Yu, Yu.

2012 IEEE Information Theory Workshop, ITW 2012. 2012. p. 109-113 6404636.

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

Dodis, Y & Yu, Y 2012, Overcoming weak expectations. in 2012 IEEE Information Theory Workshop, ITW 2012., 6404636, pp. 109-113, 2012 IEEE Information Theory Workshop, ITW 2012, Lausanne, Switzerland, 9/3/12. https://doi.org/10.1109/ITW.2012.6404636
Dodis Y, Yu Y. Overcoming weak expectations. In 2012 IEEE Information Theory Workshop, ITW 2012. 2012. p. 109-113. 6404636 https://doi.org/10.1109/ITW.2012.6404636
Dodis, Yevgeniy ; Yu, Yu. / Overcoming weak expectations. 2012 IEEE Information Theory Workshop, ITW 2012. 2012. pp. 109-113
@inproceedings{2589455ea4e3424e84e5d2873d589201,
title = "Overcoming weak expectations",
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.",
author = "Yevgeniy Dodis and Yu Yu",
year = "2012",
doi = "10.1109/ITW.2012.6404636",
language = "English (US)",
isbn = "9781467302234",
pages = "109--113",
booktitle = "2012 IEEE Information Theory Workshop, ITW 2012",

}

TY - GEN

T1 - Overcoming weak expectations

AU - Dodis, Yevgeniy

AU - Yu, Yu

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84873136980&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873136980&partnerID=8YFLogxK

U2 - 10.1109/ITW.2012.6404636

DO - 10.1109/ITW.2012.6404636

M3 - Conference contribution

SN - 9781467302234

SP - 109

EP - 113

BT - 2012 IEEE Information Theory Workshop, ITW 2012

ER -