{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:41Z","timestamp":1766281001403,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327318"},{"type":"electronic","value":"9783540327325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_31","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T07:41:35Z","timestamp":1141112495000},"page":"601-616","source":"Crossref","is-referenced-by-count":4,"title":["Separating Sources for Encryption and Secret Sharing"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]},{"given":"Bartosz","family":"Przydatek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"31_CR1","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1137\/S0097539797325636","volume":"28","author":"A. Andreev","year":"1999","unstructured":"Andreev, A., Clementi, A., Rolim, J., Trevisan, L.: Dispersers, deterministic amplification, and weak random sources. SIAM J. on Computing\u00a028(6), 2103\u20132116 (1999)","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01303199","volume":"13","author":"M. Ajtai","year":"1993","unstructured":"Ajtai, M., Linial, N.: The influence of large coalitions. Combinatorica\u00a013(2), 129\u2013145 (1993)","journal-title":"Combinatorica"},{"issue":"2","key":"31_CR3","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 J. on Computing\u00a017(2), 210\u2013229 (1988)","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02579167","volume":"6","author":"M. Blum","year":"1986","unstructured":"Blum, M.: Independent unbiased coin flips from a correlated biased source \u2014 a finite state Markov chain. Combinatorica\u00a06(2), 97\u2013108 (1986)","journal-title":"Combinatorica"},{"key":"31_CR5","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, pp. 453\u2013469. Springer, Heidelberg (2000)"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. on Computing\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM J. on Computing"},{"doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., H\u00e5stad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extraction problem of t-resilient functions. In: Proc. 26th IEEE FOCS, pp. 396\u2013407 (1985)","key":"31_CR7","DOI":"10.1109\/SFCS.1985.55"},{"doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: Proc. 45th IEEE FOCS, pp. 196\u2013205 (2004)","key":"31_CR8","DOI":"10.1109\/FOCS.2004.44"},{"doi-asserted-by":"crossref","unstructured":"Dodis, Y., Spencer, J.: On the (non-)universality of the onetime pad. In: Proc. 43rd IEEE FOCS, pp. 376\u2013388 (2002)","key":"31_CR9","DOI":"10.1109\/SFCS.2002.1181962"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-44987-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"Y. Dodis","year":"2001","unstructured":"Dodis, Y., Sahai, A., Smith, A.: On perfect and adaptive security in exposure-resilient cryptography. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 301\u2013324. Springer, Heidelberg (2001)"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1214\/aoms\/1177692552","volume":"43","author":"P. Elias","year":"1972","unstructured":"Elias, P.: The efficient construction of an unbiased random sequence. Ann. Math. Stat.\u00a043(2), 865\u2013870 (1972)","journal-title":"Ann. Math. Stat."},{"doi-asserted-by":"crossref","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In: Proc. 44th IEEE FOCS, pp. 92\u2013101 (2003)","key":"31_CR12","DOI":"10.1109\/SFCS.2003.1238184"},{"issue":"3","key":"31_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02125896","volume":"9","author":"D. Lichtenstein","year":"1989","unstructured":"Lichtenstein, D., Linial, N., Saks, M.: Some extremal problems arising from discrete control processes. Combinatorica\u00a09(3), 269\u2013287 (1989)","journal-title":"Combinatorica"},{"key":"31_CR14","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 \u201990","author":"J.L. 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.\u00a0537, pp. 421\u2013435. Springer, Heidelberg (1991)"},{"key":"31_CR15","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. 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, pp. 307\u2013321. Springer, Heidelberg (1997)"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","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 arbitrary weak secret. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 78\u201395. Springer, Heidelberg (2003)"},{"issue":"1","key":"31_CR17","first-page":"75","volume":"33","author":"M. Santha","year":"1986","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. JCSS\u00a033(1), 75\u201387 (1986)","journal-title":"JCSS"},{"doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: Proc. 41st IEEE FOCS, pp. 32\u201342 (2000)","key":"31_CR18","DOI":"10.1109\/SFCS.2000.892063"},{"key":"31_CR19","first-page":"36","volume":"12","author":"J. Neumann von","year":"1951","unstructured":"von Neumann, J.: Various techniques used in connection with random digits. National Bureau of Standards, Applied Mathematics Series\u00a012, 36\u201338 (1951)","journal-title":"National Bureau of Standards, Applied Mathematics Series"},{"doi-asserted-by":"crossref","unstructured":"Vazirani, U.V., Vazirani, V.V.: Random polynomial time is equal to slightly-random polynomial time. In: Proc. 26th IEEE FOCS, pp. 417\u2013428 (1985)","key":"31_CR20","DOI":"10.1109\/SFCS.1985.45"},{"issue":"4\/5","key":"31_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01940870","volume":"16","author":"D. Zuckerman","year":"1996","unstructured":"Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica\u00a016(4\/5), 367\u2013391 (1996)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:54:54Z","timestamp":1736286894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11681878_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}