{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:24:58Z","timestamp":1742635498157},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_22","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"252-263","source":"Crossref","is-referenced-by-count":16,"title":["On Extracting Private Randomness over a Public Channel"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Babai, L., Hajnal, P., Komlos, J., Pudlak, P.: Two lower bounds for branching programs. In: Proceedings of the eighteenth annual ACM symposium on Theory of computing, pp. 30\u201338 (1986)","DOI":"10.1145\/12130.12134"},{"key":"22_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley Interscience, New York (2000)","edition":"2"},{"issue":"6","key":"22_CR3","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 Comput.\u00a028(6), 2103\u20132116 (1999)","journal-title":"SIAM J. on Comput."},{"issue":"6","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C.H. Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.: Generalized Privacy Amplification. IEEE Transaction on Information Theory\u00a041(6), 1915\u20131923 (1995)","journal-title":"IEEE Transaction on Information Theory"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-39799-X_37","volume-title":"Advances in Cryptology","author":"C.H. Bennett","year":"1986","unstructured":"Bennett, C.H., Brassard, G., Robert, J.-M.: How to reduce your enemy\u2019s information. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 468\u2013476. Springer, Heidelberg (1986)"},{"issue":"2","key":"22_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. Comput.\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"key":"22_CR7","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":"22_CR8","unstructured":"Dodis, Y., Oliveira, R.: On extracting private randomness over a public channel (extended version), Available from http:\/\/www.math.nyu.edu\/~oliveira\/extracting.pdf"},{"key":"22_CR9","unstructured":"Dodis, Y., Spencer, J.: On the (Non-)Universality of the One-Time Pad. In: Proc. of FOCS (2002)"},{"key":"22_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., Luksak, T., Ruci\u0144ski, A.: Random Graphs. Wiley Interscience, New York (2000)"},{"key":"22_CR11","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\/780627.780630"},{"key":"22_CR12","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":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/3-540-38424-3_31","volume-title":"Proc. of CRYPTO","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)"},{"issue":"1","key":"22_CR14","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":"22_CR15","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":"22_CR16","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"},{"issue":"1","key":"22_CR17","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":"22_CR18","unstructured":"Shaltiel, R.: Recent developments in Explicit Constructions of Extractors. Bulletin of the EATCS, vol.\u00a077, pp. 67\u201395 (2002)"},{"key":"22_CR19","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 pseudo-random generator. In: Proceedings of FOCS 2001, pp. 648\u2013657. IEEE Computer Society, Los Alamitos (2001)"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0022-0000(88)90035-9","volume":"36","author":"M. Sipser","year":"1988","unstructured":"Sipser, M.: Expanders, Randomness or Time versus Space. Journal of Computer and Systems Sciences\u00a036, 379\u2013383 (1988)","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"A. Ta-Shma","year":"2000","unstructured":"Ta-Shma, A., Radhakrishnan, J.: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM Journal on Discrete Mathematics\u00a013(1), 2\u201324 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"22_CR22","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":"22_CR23","unstructured":"Trevisan, L., Vadhan, S.: Extracting Randomness from Samplable Distributions. In: Proc. of FOCS (2000)"},{"key":"22_CR24","unstructured":"Vazirani, U.: Randomness, Adversaries and Computation. PhD Thesis, University of California, Berkeley (1986)"},{"issue":"4","key":"22_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":"22_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":"22_CR27","unstructured":"Wigderson, A.: Open problems. In: Notes from DIMACS Workshop on Pseudorandomness and Explicit Combinatorial Constructions (1999)"},{"issue":"4\/5","key":"22_CR28","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-45198-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T19:56:24Z","timestamp":1685908584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}