{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:51Z","timestamp":1766281011151,"version":"3.41.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319281650"},{"type":"electronic","value":"9783319281667"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-28166-7_33","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T15:29:04Z","timestamp":1452266944000},"page":"675-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources"],"prefix":"10.1007","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Meiser","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Ruffing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/978-3-662-44371-2_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"P Austrin","year":"2014","unstructured":"Austrin, P., Chung, K.-M., Mahmoody, M., Pass, R., Seth, K.: On the impossibility of cryptography with tamperable randomness. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 462\u2013479. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"M. Backes, A. Kate, P. Manoharan, S. Meiser, and E. Mohammadi. AnoA: A framework for analyzing anonymous communication protocols. In Proc. of the 26th Computer Security Foundations Symposium (CSF\u201913), pages 163\u2013178. IEEE, 2013","key":"33_CR2","DOI":"10.1109\/CSF.2013.18"},{"doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Meiser, S., Ruffing, T.: Secrecy without perfect randomness: Cryptography with (bounded) weak sources. IACR Cryptology ePrint Archive, Report (2015). 2013\/808. Technical report (full version of this paper)","key":"33_CR3","DOI":"10.1007\/978-3-319-28166-7_33"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00145-002-0116-x","volume":"15","author":"M Bellare","year":"2002","unstructured":"Bellare, M.: A note on negligible functions. J. Cryptology 15(4), 271 (2002)","journal-title":"J. Cryptology"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-10366-7_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Bellare","year":"2009","unstructured":"Bellare, M., Brakerski, Z., Naor, M., Ristenpart, T., Segev, G., Shacham, H., Yilek, S.: Hedged public-key encryption: how to protect against bad randomness. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 232\u2013249. Springer, Heidelberg (2009)"},{"issue":"2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"CH Bennett","year":"1988","unstructured":"Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM J. Comput. 17(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-70936-7_1","volume-title":"Theory of Cryptography","author":"C Bosley","year":"2007","unstructured":"Bosley, C., Dodis, Y.: Does privacy require true randomness? In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 1\u201320. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Kalai, Y.T., Katz, J., Vaikuntanathan, V.: Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. In: Proceedings of the 51st Symposium on Foundations of Computer Science (FOCS 2010), pp. 501\u2013510. IEEE (2010)","key":"33_CR8","DOI":"10.1109\/FOCS.2010.55"},{"doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In:1 Proceedings of the 42nd Symposium on Foundations of Computer Science (FOCS 2001), pp. 36\u2013145. IEEE (2001)","key":"33_CR9","DOI":"10.1109\/SFCS.2001.959888"},{"doi-asserted-by":"crossref","unstructured":"R. Canetti, R. Pass, and A. Shelat. Cryptography from sunspots: How to use an imperfect reference string. In Proc. of the 48th Symposium on Foundations of Computer Science (FOCS\u201907), pages 249\u2013259. IEEE, 2007","key":"33_CR10","DOI":"10.1109\/FOCS.2007.4389497"},{"doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich O.: UN Based bits from sources of weak randomness and probabilistic communication complexity. In: Proceedings of the 26th Symposium on Foundations of Computer Science (FOCS1985), pp. 429\u2013442. IEEE (1985)","key":"33_CR11","DOI":"10.1109\/SFCS.1985.62"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-27821-4_30","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two independent sources. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 334\u2013344. Springer, Heidelberg (2004)"},{"key":"33_CR13","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. 4117, pp. 232\u2013250. Springer, Heidelberg (2006)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-642-32009-5_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Y Dodis","year":"2012","unstructured":"Dodis, Y., L\u00f3pez-Alt, A., Mironov, I., Vadhan, S.: Differential privacy with imperfect randomness. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 497\u2013516. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), pp. 196\u2013205. IEEE (2004)","key":"33_CR15","DOI":"10.1109\/FOCS.2004.44"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/11681878_31","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2006","unstructured":"Dodis, Y., Pietrzak, K., Przydatek, B.: Separating sources for encryption and secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 601\u2013616. Springer, Heidelberg (2006)"},{"unstructured":"Dodis, Y., Yao, Y.: Privacy and imperfect randomness. IACR Cryptology ePrint Archive, Report (2014). 2014\/623","key":"33_CR17"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36594-2_1","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2013","unstructured":"Dodis, Y., Yu, Y.: Overcoming weak expectations. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 1\u201322. Springer, Heidelberg (2013)"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Dziembowski, S. Pietrzak, K.: Leakage-resilient cryptography. In: Proceedings of the 48th Symposium on Foundations of Computer Science (FOCS 2007), pp. 293\u2013302. IEEE (2008)","key":"33_CR20","DOI":"10.1109\/FOCS.2008.56"},{"key":"33_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools. Foundations of Cryptography","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Foundations of Cryptography, vol. 1. Cambridge University Press, New York (2001)"},{"key":"33_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11561927_22","volume-title":"Distributed Computing","author":"S Goldwasser","year":"2005","unstructured":"Goldwasser, S., Sudan, M., Vaikuntanathan, V.: Distributed computing with imperfect randomness. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 288\u2013302. Springer, Heidelberg (2005)"},{"key":"33_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11426639_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"I Haitner","year":"2005","unstructured":"Haitner, I., Horvitz, O., Katz, J., Koo, C.-Y., Morselli, R., Shaltiel, R.: Reducing complexity assumptions for statistically-hiding commitment. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 58\u201377. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Li, X., Rao, A., Zuckerman, D.: Network extractor protocols. In: Proceedings of the 49th Symposium on Foundations of Computer Science (FOCS 2008), pp. 654\u2013663. IEEE (2008)","key":"33_CR24","DOI":"10.1109\/FOCS.2008.73"},{"key":"33_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-71039-4_19","volume-title":"Fast Software Encryption","author":"S Kamara","year":"2008","unstructured":"Kamara, S., Katz, J.: How to encrypt with a malicious random number generator. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 303\u2013315. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), pp. 92\u2013101. IEEE (2003)","key":"33_CR26","DOI":"10.1109\/SFCS.2003.1238184"},{"key":"33_CR27","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. CRC Press, Boca Raton (2007)"},{"key":"33_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0052244","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"UM 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. 1294, pp. 307\u2013321. Springer, Heidelberg (1997)"},{"key":"33_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/3-540-38424-3_31","volume-title":"Advances in Cryptology - CRYPTO 1990","author":"JL McInnes","year":"1991","unstructured":"McInnes, J.L., Pinkas, B.: On the impossibility of private key cryptography with weakly random keys. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 421\u2013435. Springer, Heidelberg (1991)"},{"key":"33_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126\u2013142. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Reingold, O., Trevisan, L.,Tulsiani, M., Vadhan, S.: Dense subsets of pseudorandom sets. In: Proceedings of the 49th Symposium on Foundations of Computer Science (FOCS\u201908), pp. 76\u201385. IEEE (2008)","key":"33_CR31","DOI":"10.1109\/FOCS.2008.38"},{"doi-asserted-by":"crossref","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from slightly-random sources. In: Proceedings of the 25th Symposium on Foundations of Computer Science (FOCS 1984), po. 434\u2013440. IEE (1984)","key":"33_CR32","DOI":"10.1109\/SFCS.1984.715945"},{"doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: Procedings of the 41st Symposium on Foundations of Computer Science (FOCS 2000), pp. 32\u201342. IEEE (2000)","key":"33_CR33","DOI":"10.1109\/SFCS.2000.892063"},{"key":"33_CR34","first-page":"36","volume":"12","author":"J Von Neumann","year":"1951","unstructured":"Von Neumann, J.: Various techniques used in connection with random digits. Nat. Bur. Stand. Appl. Math. Ser. 12, 36\u201338 (1951)","journal-title":"Nat. Bur. Stand. Appl. Math. Ser."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28166-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:42:53Z","timestamp":1748745773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28166-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319281650","9783319281667"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28166-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}