Key Derivation without Entropy Waste
作者： Yevgeniy Dodis , Krzysztof Pietrzak , Daniel Wichs
DOI: 10.1007/978-3-642-55220-5_6
关键词:
摘要: We revisit the classical problem of converting an imperfect source randomness into a usable cryptographic key. Assume that we have some application P expects uniformly random m-bit key R and ensures best attack (in complexity class) against P(R) has success probability at most δ. Our goal is to design key-derivation function (KDF) h converts any X min-entropy k sufficiently “good” h(X), guaranteeing P(h(X)) comparable security δ′ which ‘close’
springer.com
ist.ac.at
sci-hub.st 参考文章(31)
Alan Siegel, On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Tradeoff, and Their Applications (Extended Abstract) foundations of computer science. pp. 20- 25 ,(1989)
Boaz Barak, Ronen Shaltiel, Eran Tromer, True Random Number Generators Secure in a Changing Environment cryptographic hardware and embedded systems. pp. 166- 180 ,(2003) , 10.1007/978-3-540-45238-6_14
Yevgeniy Dodis, Rosario Gennaro, Johan Håstad, Hugo Krawczyk, Tal Rabin, Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes Advances in Cryptology – CRYPTO 2004. pp. 494- 510 ,(2004) , 10.1007/978-3-540-28628-8_30
Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai, Exposure-resilient functions and all-or-nothing transforms theory and application of cryptographic techniques. pp. 453- 469 ,(2000) , 10.1007/3-540-45539-6_33
Anindya De, Luca Trevisan, Madhur Tulsiani, Time space tradeoffs for attacks against one-way functions and PRGs international cryptology conference. pp. 649- 665 ,(2010) , 10.1007/978-3-642-14623-7_35
Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin, Computational extractors and pseudorandomness theory of cryptography conference. pp. 383- 403 ,(2012) , 10.1007/978-3-642-28914-9_22
Bonnie Berger, The fourth moment method symposium on discrete algorithms. pp. 373- 383 ,(1991) , 10.5555/127787.127854
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder, Balls and Bins: Smaller Hash Families and Faster Evaluation 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. pp. 599- 608 ,(2011) , 10.1109/FOCS.2011.49
Boaz Barak, Shai Halevi, A model and architecture for pseudo-random generation with applications to /dev/random Proceedings of the 12th ACM conference on Computer and communications security - CCS '05. pp. 203- 212 ,(2005) , 10.1145/1102120.1102148
Johan HÅstad, Russell Impagliazzo, Leonid A. Levin, Michael Luby, A Pseudorandom Generator from any One-way Function SIAM Journal on Computing. ,vol. 28, pp. 1364- 1396 ,(1999) , 10.1137/S0097539793244708