Paper Info
Title
The Chain Rule for HILL Pseudoentropy, Revisited.
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.
Year
DOI
Venue
2015
10.1007/978-3-319-22174-8_5
IACR Cryptology ePrint Archive
DocType
Volume
ISSN
Journal
2015
0302-9743
Citations 
PageRank 
References 
2
0.38
17
Authors
2
Name
Order
Citations
PageRank
Krzysztof Pietrzak1151372.60
Maciej Skorski21215.13