{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:54:02Z","timestamp":1743033242915,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207273"},{"type":"electronic","value":"9783642207280"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20728-0_1","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T09:45:24Z","timestamp":1304588724000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Correlation Extractors and Their Applications"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","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 Transactions on Information Theory\u00a041, 1915\u20131923 (1995)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"1_CR2","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. Comput.\u00a017(2), 210\u2013229 (1988)","journal-title":"SIAM J. Comput."},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.A.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1007\/3-540-44647-8_2"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H. Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 521\u2013536. Springer, Heidelberg (2006)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., Hastad, J., Friedman, J., Rudich, S., Smolensky, R.: The Bit Extraction Problem of t-Resilient Functions. In: FOCS 1985, pp. 396\u2013407 (1985)","DOI":"10.1109\/SFCS.1985.55"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: FOCS 1988, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A. Garcia","year":"1996","unstructured":"Garcia, A., Stichtenoth, H.: On the asymptotic behavior of some towers of function fields over finite fields. Journal of Number Theory\u00a061(2), 248\u2013273 (1996)","journal-title":"Journal of Number Theory"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C. Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography - Volume 2","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography - Volume 2. Cambridge University Press, Cambridge (2004)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-78524-8_22","volume-title":"Theory of Cryptography","author":"D. Harnik","year":"2008","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 393\u2013411. Springer, Heidelberg (2008)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D. Harnik","year":"2005","unstructured":"Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On tolerant combiners for oblivious transfer and other primitives. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 96\u2013113. Springer, Heidelberg (2005)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: STOC 2008, pp. 433\u2013442 (2008)","DOI":"10.1145\/1374376.1374438"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting Correlations. In: FOCS 2009, pp. 261\u2013270 (2009)","DOI":"10.1109\/FOCS.2009.56"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC 1988, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput.\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Computer and System Sciences\u00a052(1), 43\u201352 (1996)","journal-title":"J. Computer and System Sciences"},{"key":"1_CR20","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. TR-81, Harvard (1981)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"A.D. Wyner","year":"1975","unstructured":"Wyner, A.D.: The wire-tap channel. Bell Cyst. Tech. J.\u00a054, 1355\u20131387 (1975)","journal-title":"Bell Cyst. Tech. J."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: FOCS 1986, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20728-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:24:18Z","timestamp":1578533058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20728-0_1"}},"subtitle":["(Invited Talk)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207273","9783642207280"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20728-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}