今天是2024年12月13日 星期五 ynau 退出

Leftover Hash Lemma, Revisited

http://www.firstlight.cn2012/3/29

[作者] Boaz Barak Yevgeniy Dodis Hugo Krawczyk Olivier Pereira Krzysztof Pietrzak Francois-Xavier Standaert Yu Yu

[单位] Microsoft Research New England New York University East China Normal University

[摘要] Quite surprisingly, we show that both limitations of the LHL --- large entropy loss and large seed --- can often be overcome (or, at least, mitigated) in various quite general scenarios. First, we show that ent…

[关键词] foundations / Leftover Hash Lemma Randomness Extractors Key Derivation Pseudorandom Generators Entropy Loss

Quite surprisingly, we show that both limitations of the LHL --- large entropy loss and large seed --- can often be overcome (or, at least, mitigated) in various quite general scenarios. First, we show that entropy loss could be reduced to L=log(1/e) for the setting of deriving secret keys for a wide range of cryptographic applications. Specifically, the security of these schemes gracefully degrades from e to at most e + sqrt(e * 2^{-L}). (Notice that, unlike standard LHL, this bound is meaningful even for negative entropy loss, when we extract more bits than the the min-entropy we have!) Based on these results we build a general *computational extractor* that enjoys low entropy loss and can be used to instantiate a generic key derivation function for *any* cryptographic application.

存档附件原文地址

原文发布时间:2011/9/3

引用本文:

Boaz Barak;Yevgeniy Dodis;Hugo Krawczyk;Olivier Pereira;Krzysztof Pietrzak;Francois-Xavier Standaert;Yu Yu.Leftover Hash Lemma, Revisitedhttp://ynau.firstlight.cn/View.aspx?infoid=3065236&cb=Z07870000000
发布时间:2011/9/3.检索时间:2024/12/13

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...