{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:38:07Z","timestamp":1765960687649,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642227912"},{"type":"electronic","value":"9783642227929"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22792-9_1","type":"book-chapter","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T15:32:14Z","timestamp":1312558334000},"page":"1-20","source":"Crossref","is-referenced-by-count":73,"title":["Leftover Hash Lemma, Revisited"],"prefix":"10.1007","author":[{"given":"Boaz","family":"Barak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yevgeniy","family":"Dodis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois-Xavier","family":"Standaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K., Standaert, F.-X., Yu, Y.: Leftover hash lemma, revisited. Cryptology ePrint Archive, Report 2011\/088 (2011), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-22792-9_1"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Halevi, S.: A model and architecture for pseudo-random generation with applications to \/dev\/random. In: ACM CCS (2005)","DOI":"10.1145\/1102120.1102148"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-45238-6_14","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"B. Barak","year":"2003","unstructured":"Barak, B., Shaltiel, R., Tromer, E.: True Random Number Generators Secure in a Changing Environment. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 166\u2013180. Springer, Heidelberg (2003)"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C.H. Bennett","year":"1988","unstructured":"Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM Journal on Computing\u00a017(2), 210\u2013229 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11426639_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Boyen","year":"2005","unstructured":"Boyen, X., Dodis, Y., Katz, J., Ostrovsky, R., Smith, A.: Secure Remote Authentication Using Biometric Data. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 147\u2013163. Springer, Heidelberg (2005)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 453. Springer, Heidelberg (2000)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018, 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_33","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"C. Chevalier","year":"2009","unstructured":"Chevalier, C., Fouque, P.-A., Pointcheval, D., Zimmer, S.: Optimal randomness extraction from a diffie-hellman element. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, Springer, Heidelberg (2009)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"Y. Dodis","year":"2004","unstructured":"Dodis, Y., Gennaro, R., H\u00e5stad, J., Krawczyk, H., Rabin, T.: Randomness extraction and key derivation using the cbc, cascade and hmac modes. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, Springer, Heidelberg (2004)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_14","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"Y. Dodis","year":"2006","unstructured":"Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Robust fuzzy extractors and authenticated key agreement from close secrets. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, Springer, Heidelberg (2006)"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y. Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM Journal on Computing\u00a038(1), 97\u2013139 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: STOC (2006)","DOI":"10.1145\/1132516.1132615"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11818175_15","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"S. Dziembowski","year":"2006","unstructured":"Dziembowski, S.: On Forward-Secure Storage. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 251\u2013270. Springer, Heidelberg (2006)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_22","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R. Gennaro","year":"2004","unstructured":"Gennaro, R., Krawczyk, H., Rabin, T.: Secure hashed diffie-hellman over non-ddh groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, Springer, Heidelberg (2004)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: STOC (1989)","DOI":"10.1145\/73007.73010"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from parvaresh\u2013vardy codes. J. ACM\u00a056(4) (2009)","DOI":"10.1145\/1538902.1538904"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00145-003-0141-4","volume":"17","author":"G. Hast","year":"2004","unstructured":"Hast, G.: Nearly one-sided tests and the goldreich?levin predicate. J. Cryptology\u00a017(3), 209\u2013229 (2004)","journal-title":"J. Cryptology"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Key agreement from weak bit agreement. In: STOC (2005)","DOI":"10.1145\/1060590.1060689"},{"key":"1_CR20","unstructured":"Holenstein, T.: Strengthening Key Agreement using Hard-Core Sets. PhD thesis, ETH Zurich, Zurich, Switzerland (2006)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-540-28628-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"C.-Y. Hsiao","year":"2004","unstructured":"Hsiao, C.-Y., Reyzin, L.: Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 92\u2013105. Springer, Heidelberg (2004)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Structure in Complexity Theory Conference, pp. 134\u2013147 (1995)","DOI":"10.1109\/SCT.1995.514853"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC (1989)","DOI":"10.1145\/73007.73012"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: STOC (2008)","DOI":"10.1145\/1374376.1374438"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1007\/978-3-642-14623-7_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H. Krawczyk","year":"2010","unstructured":"Krawczyk, H.: Cryptographic Extraction and Key Derivation: The HKDF Scheme. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 631\u2013648. Springer, Heidelberg (2010)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"U. Maurer","year":"1997","unstructured":"Maurer, U., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, Springer, Heidelberg (1997)"},{"key":"1_CR27","unstructured":"Mitzenmacher, M., Vadhan, S.P.: Why simple hash functions work: exploiting the entropy in a data stream. In: SODA (2008)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: FOCS (1997)","DOI":"10.1145\/258533.258581"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M. Naor","year":"2009","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, Springer, Heidelberg (2009)"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/3-540-48910-X_3","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"W. Nevelsteen","year":"1999","unstructured":"Nevelsteen, W., Preneel, B.: Software Performance of Universal Hash Functions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 24. Springer, Heidelberg (1999)"},{"issue":"1","key":"1_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences\u00a052(1), 43\u201353 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_20","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"K. Pietrzak","year":"2006","unstructured":"Pietrzak, K.: Composition implies adaptive security in minicrypt. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, Springer, Heidelberg (2006)"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-70583-3_35","volume-title":"Automata, Languages and Programming","author":"K. Pietrzak","year":"2008","unstructured":"Pietrzak, K., Sj\u00f6din, J.: Weak pseudorandom functions in minicrypt. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 423\u2013436. Springer, Heidelberg (2008)"},{"issue":"1","key":"1_CR34","first-page":"2","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Computing\u00a013(1), 2\u201324 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_5","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Renner","year":"2003","unstructured":"Renner, R., Wolf, S.: Unconditional authenticity and privacy from an arbitrarily weak secret. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, Springer, Heidelberg (2003)"},{"key":"1_CR36","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"issue":"4","key":"1_CR37","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"D.R. Stinson","year":"1994","unstructured":"Stinson, D.R.: Universal hashing and authentication codes. Designs, Codes, and Cryptography\u00a04(4), 369\u2013380 (1994)","journal-title":"Designs, Codes, and Cryptography"},{"key":"1_CR38","first-page":"3","volume":"42","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Universal hash families and the leftover hash lemma, and applications to cryptography and computing. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a042, 3\u201331 (2002), http:\/\/www.cacr.math.uwaterloo.ca\/~dstinson\/publist.html","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2011"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22792-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T07:25:31Z","timestamp":1741418731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22792-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642227912","9783642227929"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22792-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}