OASIcs.ICCSW.2014.83.pdf
- Filesize: 0.62 MB
- 8 pages
Document
On Recent Advances in Key Derivation via the Leftover Hash Lemma
Author
-
Part of:
Volume:
2014 Imperial College Computing Student Workshop (ICCSW 2014)
Series: Open Access Series in Informatics (OASIcs) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-10-08
Cite As Get BibTex
Maciej Skorski. On Recent Advances in Key Derivation via the Leftover Hash Lemma. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 83-90, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/OASIcs.ICCSW.2014.83
Abstract
Barak et al. showed how to significantly reduce the entropy loss, which is necessary in general, in the use of the Leftover Hash Lemma (LHL) to derive a secure key for many important cryptographic applications. If one wants this key to be secure against any additional short leakage, then the min-entropy of the source used with the LHL must be big enough. Recently, Berens came up with a notion of collision entropy that is much weaker than min-entropy and allows proving a version of the LHL with leakage robustness but without any entropy saving. We combine both approaches and extend the results of Barak et. al to the collision entropy. Summarizing, we obtain a version of the LHL with optimized entropy loss, leakage robustness and weak entropy requirements.
Subject Classification
Keywords
- Key derivation
- Leftover Hash Lemma
- leakage robustness
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Boaz Barak, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Pietrzak, Francois-Xavier Standaert, and Yu Yu. Leftover hash lemma, revisited. Cryptology ePrint Archive, Report 2011/088, 2011. URL: http://eprint.iacr.org/.
-
Stefan Berens. Conditional renyi entropy. Master’s thesis, Mathematisch Instituut, Universiteit Leiden, 2013.
-
Yevgeniy Dodis and Yu Yu. Overcoming weak expectations. In Amit Sahai, editor, Theory of Cryptography, volume 7785 of Lecture Notes in Computer Science, pages 1-22. Springer Berlin Heidelberg, 2013.
-
Johan Hastad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
-
Jaikumar Radhakrishnan and Amnon Ta-Shma. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics, 13:2000, 2000.
-
R. Renner and S. Wolf. Smooth Renyi entropy and applications. In International Symposium on Information Theory, 2004. ISIT 2004. Proceedings., page 232. IEEE, 2004.
-
D.R. Stinson. Universal hashing and authentication codes. Designs, Codes and Cryptography, 4(3):369-380, 1994.