{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:35:37Z","timestamp":1760027737625},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850922"},{"type":"electronic","value":"9783540850939"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85093-9_19","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T10:24:37Z","timestamp":1218536677000},"page":"199-209","source":"Crossref","is-referenced-by-count":1,"title":["Simple Direct Reduction of String (1,2)-OT to Rabin\u2019s OT without Privacy Amplification"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Koshiba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms\u00a03(3), 289\u2013304 (1992)","journal-title":"Random Structures and Algorithms"},{"issue":"6","key":"19_CR2","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.M.: Generalized privacy amplification. IEEE Transactions on Information Theory\u00a041(6), 1915\u20131923 (1995)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"19_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 Journal on Computing\u00a017(2), 210\u2013229 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/3-540-48405-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"V. Boyko","year":"1999","unstructured":"Boyko, V.: On the security properties of OAEP as an all-or-nothing transform. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 503\u2013518. Springer, Heidelberg (1999)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-69053-0_23","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"G. Brassard","year":"1997","unstructured":"Brassard, G., Cr\u00e9peau, C.: Oblivious transfers and privacy amplification. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 334\u2013347. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.-M.: Information theoretic reductions among disclosure problems. In: Proc. 27th IEEE Symposium on Foundations of Computer Science, pp. 168\u2013173 (1986)","key":"19_CR6","DOI":"10.1109\/SFCS.1986.26"},{"issue":"6","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G. Brassard","year":"1996","unstructured":"Brassard, G., Cr\u00e9peau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory\u00a042(6), 1769\u20131780 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-002-0146-4","volume":"16","author":"G. Brassard","year":"2003","unstructured":"Brassard, G., Cr\u00e9peau, C., Wolf, S.: Oblivious transfers and privacy amplification. Journal of Cryptology\u00a016(4), 219\u2013237 (2003)","journal-title":"Journal of Cryptology"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0054139","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"C. Cachin","year":"1998","unstructured":"Cachin, C.: On the foundations of oblivious transfer. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 361\u2013374. Springer, Heidelberg (1998)"},{"key":"19_CR10","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)"},{"doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., H\u00e5stad, J., Friedman, J., Rudich, R., Smolensky, R.: The bit extraction problem or t-resilient functions. In: Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 396\u2013407 (1985)","key":"19_CR11","DOI":"10.1109\/SFCS.1985.55"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"C. Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-69053-0_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"C. Cr\u00e9peau","year":"1997","unstructured":"Cr\u00e9peau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 306\u2013317. Springer, Heidelberg (1997)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/11761679_32","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Cr\u00e9peau","year":"2006","unstructured":"Cr\u00e9peau, C., Savvides, G., Schaffner, C., Wullschleger, J.: Information-theoretic conditions for two-party secure function evaluation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 538\u2013554. Springer, Heidelberg (2006)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/11818175_26","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Salvail, L., Schaffner, C.: Oblivious transfer and linear functions. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 427\u2013444. Springer, Heidelberg (2006)"},{"unstructured":"Dodis, Y.: Exposure-Resilient Cryptography. PhD thesis, Dept. Electrical Engineering and Computer Science, MIT (2000)","key":"19_CR16"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-48910-X_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"Y. Dodis","year":"1999","unstructured":"Dodis, Y., Micali, S.: Lower bounds for oblivious transfer reductions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 42\u201355. Springer, Heidelberg (1999)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","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. 299\u2013322. Springer, Heidelberg (2001)"},{"issue":"6","key":"19_CR19","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 ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of ACM"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1137\/S0097539705447049","volume":"36","author":"A. Gabizon","year":"2006","unstructured":"Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM Journal on Computing\u00a036(4), 1072\u20131094 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sum of bounded random variables. Journal of the American Statistical Association\u00a058, 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"doi-asserted-by":"crossref","unstructured":"Imai, H., Morozov, K., Nascimento, A.: On the oblivious transfer capacity of the erasure channel. In: Proc. 2006 IEEE International Symposium on Information Theory, pp.1428\u20131431 (2006)","key":"19_CR22","DOI":"10.1109\/ISIT.2006.262082"},{"issue":"5","key":"19_CR23","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/S0097539705446846","volume":"36","author":"J. Kamp","year":"2007","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM Journal on Computing\u00a036(5), 1231\u20131247 (2007)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"19_CR24","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00145-001-0010-y","volume":"14","author":"K. Kurosawa","year":"2001","unstructured":"Kurosawa, K., Johansson, T., Stinson, D.: Almost k-wise independent sample spaces and their cryptologic applications. Journal of Cryptology\u00a014(4), 231\u2013253 (2001)","journal-title":"Journal of Cryptology"},{"issue":"6","key":"19_CR25","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1109\/TIT.2008.921704","volume":"54","author":"K. Kurosawa","year":"2008","unstructured":"Kurosawa, K., Kishimoto, W., Koshiba, T.: A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions. IEEE Transactions on Information Theory\u00a054(6), 2566\u20132571 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11786986_9","volume-title":"Automata, Languages and Programming","author":"C.-J. Lee","year":"2006","unstructured":"Lee, C.-J., Lu, C.-J., Tsai, S.-C.: Deterministic extractors for independent-symbol sources. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 84\u201395. Springer, Heidelberg (2006)"},{"unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University (1981)","key":"19_CR27"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption","author":"R. Rivest","year":"1997","unstructured":"Rivest, R.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 210\u2013218. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Wolf, S.: Reducing oblivious string transfer to universal oblivious transfer. In: Proc. 2000 IEEE International Symposium on Information Theory, p.465 (2000)","key":"19_CR29","DOI":"10.1109\/ISIT.2000.866763"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/11535218_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"S. Wolf","year":"2005","unstructured":"Wolf, S., Wullschleger, J.: New monotones and lower bounds in unconditional two-party computation. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 467\u2013477. Springer, Heidelberg (2005)"}],"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-540-85093-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:21:48Z","timestamp":1606184508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85093-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850922","9783540850939"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85093-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}