The chain rule for HILL pseudoentropy, revisited Conference Paper


Author(s): Pietrzak, Krzysztof; Skórski, Maciej
Title: The chain rule for HILL pseudoentropy, revisited
Title Series: LNCS
Affiliation IST Austria
Abstract: Computational notions of entropy (a.k.a. pseudoentropy) have found many applications, including leakage-resilient cryptography, deterministic encryption or memory delegation. The most important tools to argue about pseudoentropy are chain rules, which quantify by how much (in terms of quantity and quality) the pseudoentropy of a given random variable X decreases when conditioned on some other variable Z (think for example of X as a secret key and Z as information leaked by a side-channel). In this paper we give a very simple and modular proof of the chain rule for HILL pseudoentropy, improving best known parameters. Our version allows for increasing the acceptable length of leakage in applications up to a constant factor compared to the best previous bounds. As a contribution of independent interest, we provide a comprehensive study of all known versions of the chain rule, comparing their worst-case strength and limitations.
Conference Title: LATINCRYPT: Cryptology and Information Security in Latin America
Volume: 9230
Conference Dates: August 23-26, 2015
Conference Location: Guadalajara, Mexico
ISBN: 978-331922173-1
Publisher: Springer  
Date Published: 2015-08-15
Start Page: 81
End Page: 98
Sponsor: Research supported by ERC starting grant (259668-PSPC)
URL:
DOI: 10.1007/978-3-319-22174-8_5
Open access: yes (repository)
IST Austria Authors
Related IST Austria Work