{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:50:31Z","timestamp":1776955831248,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228943","type":"print"},{"value":"9783540278214","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27821-4_30","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T18:54:06Z","timestamp":1284490446000},"page":"334-344","source":"Crossref","is-referenced-by-count":41,"title":["Improved Randomness Extraction from Two Independent Sources"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Elbaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Raz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","first-page":"1749","volume-title":"Handbook of Combinatorics","author":"N. Alon","year":"1995","unstructured":"Alon, N.: Tools from higher algebra. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e0sz, L. (eds.) Handbook of Combinatorics, ch.32, pp. 1749\u20131783. North Holland, Amsterdam (1995)"},{"issue":"6","key":"30_CR2","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1137\/S0097539797325636","volume":"28","author":"A.C. Andreev","year":"1999","unstructured":"Andreev, A.C., Rolim, J., Trevisan, L.: Trevisan. Dispersers, deterministic amplification, and weak random sources. SIAM J. on Comput.\u00a028(6), 2103\u20132116 (1999)","journal-title":"SIAM J. on Comput."},{"key":"30_CR3","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting Randomness from Few Independent Sources (2004) (manuscript)"},{"issue":"2","key":"30_CR4","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. Comput.\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, A., Wigderson, A.: Dispersers, deterministic amplification, and weak random sources. In: Proc. of FOCS, pp. 14\u201319 (1989)","DOI":"10.1109\/SFCS.1989.63449"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Spencer, J.: On the (Non-)Universality of the One-Time Pad. In: Proc. of FOCS (2002)","DOI":"10.1109\/SFCS.2002.1181962"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Oliveira, R.: On Extracting Private Randomness over a Public Channel. In: RANDOM-APPROX, pp. 252\u2013263 (2003)","DOI":"10.1007\/978-3-540-45198-3_22"},{"key":"30_CR8","unstructured":"Goldreich, O.: Three XOR-Lemmas - An Exposition. Electronic Colloquium on Computational Complexity, ECCC (1995)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Spencer, J.H.: A constructive solution to a tournament problem. Canad. Math. Bull.\u00a014, 45\u201348","DOI":"10.4153\/CMB-1971-007-1"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Lu, C., Reingold, O., Vadhan, S., Wigderson, A.: Extractors: Optimal Up to Constant Factors. In: Proc. of STOC (2003)","DOI":"10.1145\/780542.780630"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"30_CR12","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. McInnes","year":"1991","unstructured":"McInnes, J., 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":"30_CR13","doi-asserted-by":"crossref","unstructured":"Meshulam, R.: Spaces of Hankel matrices over finite fields. Linear Algebra and its Applications\u00a0218 (1995)","DOI":"10.1016\/0024-3795(93)00158-V"},{"key":"30_CR14","unstructured":"E. Mossel, A. Shpilka, L. Trevisan. On \u03b5 \u2212 biased Generators in NC0. In Proc. of FOCS, 2003."},{"issue":"1","key":"30_CR15","first-page":"148","volume":"58","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ta-Shma, A.: Extracting Randomness: a survey and new constructions. JCSS\u00a058(1), 148\u2013173 (1999)","journal-title":"JCSS"},{"issue":"1","key":"30_CR16","first-page":"43","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is Linear in Space. JCSS\u00a052(1), 43\u201352 (1996)","journal-title":"JCSS"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in Trevisan\u2019s extractors. Journal of Computer and System Sciences (2002)","DOI":"10.1006\/jcss.2002.1824"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"R\u00f3nyai, L., Babai, L., Ganapathy, M.: On the number of zero-patterns in a sequence of polynomials. Journal of the AMS (2002)","DOI":"10.1090\/S0894-0347-01-00367-8"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Roth, R.: Maximum rank array codes and their application to crisscross error correction. IEEE transactions on Information Theory\u00a037 (1991)","DOI":"10.1109\/18.75248"},{"issue":"1","key":"30_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M. S\u00e1ntha","year":"1986","unstructured":"S\u00e1ntha, M., Vazirani, U.: Generating Quasi-Random Sequences from Semi-Random Sources. Journal of Computer and System Sciences\u00a033(1), 75\u201387 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR21","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in Explicit Constructions of Extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"key":"30_CR22","first-page":"648","volume-title":"Proceedings of FOCS 2001","author":"R. Shaltiel","year":"2001","unstructured":"Shaltiel, R., Umans, C.: Simple extractors for all min-entropies and a new pseudorandom generator. In: Proceedings of FOCS 2001, pp. 648\u2013657. IEEE Computer Society, Los Alamitos (2001)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Construction of Extractors Using PseudoRandom Generators. In: Proc. of STOC, pp. 141\u2013148 (1999)","DOI":"10.1145\/301250.301289"},{"key":"30_CR24","unstructured":"Vazirani, U.: Randomness, Adversaries and Computation. PhD Thesis, University of California, Berkeley (1986)"},{"issue":"4","key":"30_CR25","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF02579325","volume":"7","author":"U. Vazirani","year":"1987","unstructured":"Vazirani, U.: Strong Communication Complexity or Generating Quasi-Random Sequences from Two Communicating Semi-Random Sources. Combinatorica\u00a07(4), 375\u2013392 (1987)","journal-title":"Combinatorica"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Vazirani, U., Vazirani, V.: Random polynomial time is equal to slightly-random polynomial time. In: Proc. of 26th FOCS, pp. 417\u2013428 (1985)","DOI":"10.1109\/SFCS.1985.45"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Vazirani, U.: Efficiency Considerations in using semi-random sources. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 160\u2013168 (1987)","DOI":"10.1145\/28395.28413"},{"key":"30_CR28","unstructured":"Wigderson, A.: Open problems. Notes from DIMACS Workshop on Pseudorandomness and Explicit Combinatorial Constructions (1999)"},{"issue":"4\/5","key":"30_CR29","doi-asserted-by":"crossref","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","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27821-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T09:29:16Z","timestamp":1685784556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27821-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228943","9783540278214"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27821-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}