{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:24Z","timestamp":1772283504479,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642365935","type":"print"},{"value":"9783642365942","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36594-2_1","type":"book-chapter","created":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T02:43:27Z","timestamp":1360205007000},"page":"1-22","source":"Crossref","is-referenced-by-count":47,"title":["Overcoming Weak Expectations"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22792-9_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"B. Barak","year":"2011","unstructured":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K., Standaert, F.-X., Yu, Y.: Leftover Hash Lemma, Revisited. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 1\u201320. Springer, Heidelberg (2011)"},{"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: Proceedings of the 12th ACM Conference on Computer and Communication Security, pp. 203\u2013212 (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)"},{"key":"1_CR4","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_CR5","unstructured":"Brakerski, Z., Goldreich, O.: From absolute distinguishability to positive distinguishability. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a016, p. 31 (2009)"},{"key":"1_CR6","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_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, G., Raz, R., Segev, G.: Non-malleable extractors with short seeds and applications to privacy amplification. In: Proceedings of the 27th Computational Complexity, pp. 110\u2013124 (2012)","DOI":"10.1109\/CCC.2012.21"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-540-78524-8_33","volume-title":"Theory of Cryptography","author":"N. Dedi\u0107","year":"2008","unstructured":"Dedi\u0107, N., Harnik, D., Reyzin, L.: Saving Private Randomness in One-Way Functions and Pseudorandom Generators. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 607\u2013625. Springer, Heidelberg (2008)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","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, pp. 232\u2013250. Springer, Heidelberg (2006)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Li, X., Wooley, T.D., Zuckerman, D.: Privacy amplification and non-malleable extractors via character sums. In: Proceedings of the 52nd IEEE Symposium on Foundation of Computer Science, pp. 668\u2013677 (2011)","DOI":"10.1109\/FOCS.2011.67"},{"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","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-642-28914-9_35","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2012","unstructured":"Dodis, Y., Ristenpart, T., Vadhan, S.: Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 618\u2013635. Springer, Heidelberg (2012)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Smith, A.: Correcting errors without leaking partial information. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, May 22-24, pp. 654\u2013663 (2005)","DOI":"10.1145\/1060590.1060688"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, pp. 601\u2013610. ACM (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Yu, Y.: Overcoming weak expectactions (2012), full version of this paper http:\/\/cs.nyu.edu\/~dodis\/ps\/weak-expe.pdf","DOI":"10.1109\/ITW.2012.6404636"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: Proceedings of the 49th IEEE Symposium on Foundation of Computer Science, pp. 293\u2013302 (2008)","DOI":"10.1109\/FOCS.2008.56"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-642-28914-9_33","volume-title":"Theory of Cryptography","author":"B. Fuller","year":"2012","unstructured":"Fuller, B., O\u2019Neill, A., Reyzin, L.: A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 582\u2013599. Springer, Heidelberg (2012)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","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\u00a0Groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 361\u2013381. Springer, Heidelberg (2004)"},{"issue":"4","key":"1_CR19","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_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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_CR21","doi-asserted-by":"crossref","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: Proceedings of the 53rd IEEE Symposium on Foundation of Computer Science, pp. 688\u2013697 (2012)","DOI":"10.1109\/FOCS.2012.26"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0052244","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"U.M. Maurer","year":"1997","unstructured":"Maurer, U.M., Wolf, S.: Privacy Amplification Secure against Active Adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 307\u2013321. Springer, Heidelberg (1997)"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci.\u00a058(2), 336\u2013375 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-01001-9_27","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"K. Pietrzak","year":"2009","unstructured":"Pietrzak, K.: A Leakage-Resilient Mode of Operation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 462\u2013482. Springer, Heidelberg (2009)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Raz, R., Reingold, O.: On recycling the randomness of states in space bounded computation. In: Proceedings of the 31st ACM Symposium on the Theory of Computing, pp. 159\u2013168 (1999)","DOI":"10.1145\/301250.301294"},{"issue":"5","key":"1_CR26","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1137\/S0097539703431032","volume":"35","author":"O. Reingold","year":"2006","unstructured":"Reingold, O., Shaltiel, R., Wigderson, A.: Extracting randomness via repeated condensing. SIAM J. Comput.\u00a035(5), 1185\u20131209 (2006)","journal-title":"SIAM J. Comput."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Tulsiani, M., Vadhan, S.P.: Dense subsets of pseudorandom sets. In: Proceedings of the 49th IEEE Symposium on Foundation of Computer Science, pp. 76\u201385 (2008)","DOI":"10.1109\/FOCS.2008.38"},{"key":"1_CR28","unstructured":"Tao, T., Ziegler, T.: The primes contain arbitrarily long polynomial progressions (2006), http:\/\/arxiv.org\/abs\/math.NT\/0610050"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, pp. 32\u201342. IEEE (November 2000)","DOI":"10.1109\/SFCS.2000.892063"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36594-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T20:11:19Z","timestamp":1745957479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36594-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642365935","9783642365942"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36594-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}