{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:53:22Z","timestamp":1767970402710,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642542411","type":"print"},{"value":"9783642542428","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_24","type":"book-chapter","created":{"date-parts":[[2014,2,3]],"date-time":"2014-02-03T02:42:54Z","timestamp":1391395374000},"page":"566-590","source":"Crossref","is-referenced-by-count":25,"title":["How to Fake Auxiliary Input"],"prefix":"10.1007","author":[{"given":"Dimitar","family":"Jetchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_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":"24_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Hardt, M., Kale, S.: The uniform hardcore lemma via approximate bregman projections. In: Mathieu, C. (ed.) SODA, pp. 1193\u20131200. SIAM (2009)","DOI":"10.1137\/1.9781611973068.129"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rompel, J.: Randomness-efficient oblivious sampling. In: FOCS, pp. 276\u2013287 (1994)","DOI":"10.1109\/SFCS.1994.365687"},{"key":"24_CR4","unstructured":"Chung, K.M., Lui, E., Pass, R.: From weak to strong zero-knowledge and applications. Cryptology ePrint Archive, Report 2013\/260 (2013), http:\/\/eprint.iacr.org\/"},{"key":"24_CR5","first-page":"113","volume":"16","author":"A. De","year":"2009","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Non-uniform attacks against one-way functions and prgs. Electronic Colloquium on Computational Complexity (ECCC)\u00a016, 113 (2009)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-14623-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A. De","year":"2010","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 649\u2013665. Springer, Heidelberg (2010)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-14623-7_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"Y. Dodis","year":"2010","unstructured":"Dodis, Y., Pietrzak, K.: Leakage-resilient pseudorandom functions and side-channel attacks on Feistel networks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 21\u201340. Springer, Heidelberg (2010)"},{"key":"24_CR8","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.\u00a03027, pp. 523\u2013540. Springer, Heidelberg (2004)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K.: Intrusion-resilient secret sharing. In: 48th FOCS, pp. 227\u2013237. IEEE Computer Society Press (October 2007)","DOI":"10.1109\/FOCS.2007.63"},{"key":"24_CR10","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"},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s004930050052","volume":"19","author":"A.M. Frieze","year":"1999","unstructured":"Frieze, A.M., Kannan, R.: Quick approximation to matrices and applications. Combinatorica\u00a019(2), 175\u2013220 (1999)","journal-title":"Combinatorica"},{"key":"24_CR12","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":"24_CR13","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":"4","key":"24_CR14","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1112\/blms\/bdq018","volume":"42","author":"T. Gowers","year":"2010","unstructured":"Gowers, T.: Decompositions, approximate structure, transference, and the Hahn\u2013Banach theorem. Bull. London Math. Soc.\u00a042(4), 573\u2013606 (2010)","journal-title":"Bull. London Math. Soc."},{"issue":"4","key":"24_CR15","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 Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR16","first-page":"281","volume":"1","author":"M. Herbster","year":"2001","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best linear predictor. Journal of Machine Learning Research\u00a01, 281\u2013309 (2001)","journal-title":"Journal of Machine Learning Research"},{"key":"24_CR17","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.\u00a04515, pp. 169\u2013186. Springer, Heidelberg (2007)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: FOCS, pp. 538\u2013545 (1995)","DOI":"10.1109\/SFCS.1995.492584"},{"key":"24_CR19","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 - and what deniable encryption has to do with it. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 23\u201339. Springer, Heidelberg (2013)"},{"key":"24_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.\u00a05479, pp. 462\u2013482. Springer, Heidelberg (2009)"},{"key":"24_CR21","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":"24_CR22","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 - (invited talk). In: Fehr, S. (ed.) ICITS 2011. LNCS, vol.\u00a06673, pp. 138\u2013142. Springer, Heidelberg (2011), http:\/\/www.cs.bu.edu\/~reyzin\/papers\/entropy-survey.pdf"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11511-008-0032-5","volume":"201","author":"T. Tao","year":"2008","unstructured":"Tao, T., Ziegler, T.: The primes contain arbitrarily long polynomial progressions. Acta Math.\u00a0201, 213\u2013305 (2008)","journal-title":"Acta Math."},{"issue":"2","key":"24_CR24","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1556154.1556170","volume":"40","author":"L. Trevisan","year":"2009","unstructured":"Trevisan, L.: Guest column: additive combinatorics and theoretical computer science. SIGACT News\u00a040(2), 50\u201366 (2009)","journal-title":"SIGACT News"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Tulsiani, M., Vadhan, S.P.: Regularity, boosting, and efficiently simulating every high-entropy distribution. In: IEEE Conference on Computational Complexity, pp. 126\u2013136 (2009)","DOI":"10.1109\/CCC.2009.41"},{"key":"24_CR26","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.\u00a08042, pp. 93\u2013110. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54242-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T19:09:04Z","timestamp":1746126544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}