{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:58:24Z","timestamp":1743004704564,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662536407"},{"type":"electronic","value":"9783662536414"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53641-4_8","type":"book-chapter","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T15:48:14Z","timestamp":1477064894000},"page":"183-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pseudoentropy: Lower-Bounds for Chain Rules and Transformations"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Pietrzak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Sk\u00f3rski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,22]]},"reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"T Baker","year":"1975","unstructured":"Baker, T., Gill, J., Solovay, R.: Relativizations of the p=?np question. SIAM J. Comput. 4(4), 431\u2013442 (1975)","journal-title":"SIAM J. Comput."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd FOCS, pp. 106\u2013115. IEEE Computer Society Press, October 2001","DOI":"10.1109\/SFCS.2001.959885"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-45198-3_18","volume-title":"Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques","author":"Boaz Barak","year":"2003","unstructured":"Barak, B., Shaltiel, R., Wigderson, A.: Computational analogues of entropy. In: 11th International Conference on Random Structures and Algorithms, pp. 200\u2013215 (2003)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-22792-9_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"K-M Chung","year":"2011","unstructured":"Chung, K.-M., Kalai, Y.T., Liu, F.-H., Raz, R.: Memory delegation. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 151\u2013168. Springer, Heidelberg (2011)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-24676-3_31","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523\u2013540. Springer, Heidelberg (2004)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: 49th FOCS, pp. 293\u2013302. IEEE Computer Society Press, October 2008","DOI":"10.1109\/FOCS.2008.56"},{"key":"8_CR7","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. 7194, pp. 582\u2013599. Springer, Heidelberg (2012)"},{"key":"8_CR8","unstructured":"Fuller, B., Reyzin, L.: Computational entropy and information leakage. Cryptology ePrint Archive, report 2012\/466 (2012). \n                      http:\/\/eprint.iacr.org\/"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 99\u2013108. ACM Press, June 2011","DOI":"10.1145\/1993636.1993651"},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0222069","volume":"22","author":"O Goldreich","year":"1993","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM J. Comput. 22(6), 1163\u20131175 (1993)","journal-title":"SIAM J. Comput."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.P.: Efficiency improvements in constructing pseudorandom generators from one-way functions. In: Schulman, L.J. (ed.) 42nd ACM STOC, pp. 437\u2013446. ACM Press, June 2010","DOI":"10.1145\/1806689.1806750"},{"issue":"4","key":"8_CR12","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.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11681878_23","volume-title":"Theory of Cryptography","author":"T Holenstein","year":"2006","unstructured":"Holenstein, T.: Pseudorandom generators from one-way functions: a simple construction for any hardness. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 443\u2013461. Springer, Heidelberg (2006)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Holenstein, T., Sinha, M.: Constructing a pseudorandom generator requires an almost linear number of calls. In: 53rd FOCS, pp. 698\u2013707. IEEE Computer Society Press, October 2012","DOI":"10.1109\/FOCS.2012.51"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-72540-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"C-Y Hsiao","year":"2007","unstructured":"Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 169\u2013186. Springer, Heidelberg (2007)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/0-387-34799-2_2","volume-title":"Advances in Cryptology - CRYPTO 1988","author":"R Impagliazzo","year":"1990","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 8\u201326. Springer, Heidelberg (1990)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-54242-8_24","volume-title":"Theory of Cryptography","author":"D Jetchev","year":"2014","unstructured":"Jetchev, D., Pietrzak, K.: How to fake auxiliary input. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 566\u2013590. Springer, Heidelberg (2014)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-36594-2_2","volume-title":"Theory of Cryptography","author":"S Krenn","year":"2013","unstructured":"Krenn, S., Pietrzak, K., Wadia, A.: A counterexample to the chain rule for conditional HILL entropy. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 23\u201339. Springer, Heidelberg (2013)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-73420-8_18","volume-title":"Automata, Languages and Programming","author":"C-J Lu","year":"2007","unstructured":"Lu, C.-J., Tsai, S.-C., Wu, H.-L.: On the complexity of hard-core set constructions. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 183\u2013194. Springer, Heidelberg (2007)"},{"key":"8_CR20","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. 5479, pp. 462\u2013482. Springer, Heidelberg (2009)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-22174-8_5","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"K Pietrzak","year":"2015","unstructured":"Pietrzak, K., Sk\u00f3rski, M.: The chain rule for HILL pseudoentropy, revisited. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LatinCrypt 2015. LNCS, vol. 9230, pp. 81\u201398. Springer, Heidelberg (2015)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L., Tulsiani, M., Vadhan, S.P.: Dense subsets of pseudorandom sets. In: 49th FOCS, pp. 76\u201385. IEEE Computer Society Press, October 2008","DOI":"10.1109\/FOCS.2008.38"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-20728-0_13","volume-title":"Information Theoretic Security","author":"L Reyzin","year":"2011","unstructured":"Reyzin, L.: Some notions of entropy for cryptography. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol. 6673, pp. 138\u2013142. Springer, Heidelberg (2011)"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"DR Simon","year":"1998","unstructured":"Simon, D.R.: Findings collisions on a one-way street: can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-319-17470-9_7","volume-title":"Information Theoretic Security","author":"M Skorski","year":"2015","unstructured":"Skorski, M.: Metric pseudoentropy: characterizations, transformations and applications. In: Lehmann, A., Wolf, S. (eds.) Information Theoretic Security. LNCS, vol. 9063, pp. 105\u2013122. Springer, Heidelberg (2015)"},{"key":"8_CR26","first-page":"279","volume-title":"Lecture Notes in Computer Science","author":"Maciej Sk\u00f3rski","year":"2016","unstructured":"Skorski, M.: A better chain rule for hill pseudoentropy - beyond bounded leakage. In: Information Theoretic Security - 9th International Conference, ICITS 2016 (2016)"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Skorski, M.: Simulating auxiliary information, revisited. In: TCC 2016-B (2016)","DOI":"10.1007\/978-3-662-53641-4_7"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: Karloff, H.J., Pitassi, T. (eds.) 44th ACM STOC, pp. 817\u2013836. ACM Press, May 2012","DOI":"10.1145\/2213977.2214051"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-40041-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Vadhan","year":"2013","unstructured":"Vadhan, S., Zheng, C.J.: A uniform min-max theorem with applications in cryptography. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 93\u2013110. Springer, Heidelberg (2013)"},{"issue":"1","key":"8_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2676659","volume":"7","author":"T Watson","year":"2014","unstructured":"Watson, T.: Advice lower bounds for the dense model theorem. TOCT 7(1), 1 (2014)","journal-title":"TOCT"},{"key":"8_CR31","first-page":"38","volume":"18","author":"J Zhang","year":"2011","unstructured":"Zhang, J.: On the query complexity for showing dense model. Electron. Colloquium Comput. Complexity (ECCC) 18, 38 (2011)","journal-title":"Electron. Colloquium Comput. Complexity (ECCC)"}],"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-662-53641-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:03:25Z","timestamp":1603411405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53641-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662536407","9783662536414"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53641-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}