{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:41:16Z","timestamp":1725540076438},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102295"},{"type":"electronic","value":"9783642102301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10230-1_16","type":"book-chapter","created":{"date-parts":[[2009,10,31]],"date-time":"2009-10-31T12:41:06Z","timestamp":1256992866000},"page":"183-194","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Oblivious Transfer Protocols Achieving a Non-zero Rate from Any Non-trivial Noisy Correlation"],"prefix":"10.1007","author":[{"given":"Hideki","family":"Imai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing Oblivious Transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Heidelberg (1995)"},{"issue":"6","key":"16_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.: Generalized Privacy Amplification. IEEE Trans. Inf. Theory\u00a041(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal Classes of hash functions. J.\u00a0of Computer and Syst. Sci.\u00a018, 143\u2013154 (1979)","journal-title":"J.\u00a0of Computer and Syst. Sci."},{"key":"16_CR4","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 flavors of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"16_CR5","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":"16_CR6","first-page":"42","volume-title":"Proc. 29th FOCS","author":"C. Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: Proc. 29th FOCS, pp. 42\u201352. IEEE, Los Alamitos (1988)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-540-30598-9_4","volume-title":"Security in Communication Networks","author":"C. Cr\u00e9peau","year":"2005","unstructured":"Cr\u00e9peau, C., Morozov, K., Wolf, S.: Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 47\u201359. Springer, Heidelberg (2005)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11761679_13","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Cr\u00e9peau","year":"2006","unstructured":"Cr\u00e9peau, C., Savvides, G.: Optimal Reductions Between Oblivious Transfers Using Interactive Hashing. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 201\u2013221. Springer, Heidelberg (2006)"},{"issue":"6","key":"16_CR9","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. Comm. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Comm. ACM"},{"key":"16_CR10","volume-title":"Concatenated codes","author":"G.D. Forney","year":"1966","unstructured":"Forney, G.D.: Concatenated codes. MIT Press, Cambridge (1966)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/11535218_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"T. Holenstein","year":"2005","unstructured":"Holenstein, T., Renner, R.: One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 478\u2013493. Springer, Heidelberg (2005)"},{"key":"16_CR12","first-page":"1428","volume-title":"Proc. ISIT 2006","author":"H. Imai","year":"2006","unstructured":"Imai, H., Morozov, K., Nascimento, A.C.A.: On the Oblivious Transfer Capacity of the Erasure Channel. In: Proc. ISIT 2006, pp. 1428\u20131431. IEEE, Los Alamitos (2006)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding Cryptography on Oblivious Transfer. In: Proc.\u00a0STOC 1988, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-45116-1_22","volume-title":"Information Assurance in Computer Networks. Methods, Models and Architectures for Network Security","author":"V. Korjik","year":"2001","unstructured":"Korjik, V., Morozov, K.: Generalized Oblivious Transfer Protocols Based on Noisy Channels. In: Gorodetski, V.I., Skormin, V.A., Popyack, L.J. (eds.) MMM-ACNS 2001. LNCS, vol.\u00a02052, pp. 219\u2013229. Springer, Heidelberg (2001)"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A Pseudorandom Generator from any one-way function. SIAM J. on Comp.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. on Comp."},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: Secret Key Agreement by Public Discussion. IEEE Trans. Inf. Theory\u00a039(3), 733\u2013742 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect Zero-Knowledge Arguments for NP using any one-way permutation. J. of Cryptology\u00a011(2) (1998)","DOI":"10.1007\/s001459900037"},{"key":"16_CR18","unstructured":"Nascimento, A., Winter, A.: Oblivious Transfer from any Genuine Noise, pre-print version (2004)"},{"key":"16_CR19","first-page":"1871","volume-title":"Proc. ISIT 2006","author":"A. Nascimento","year":"2006","unstructured":"Nascimento, A., Winter, A.: On the Oblivious Transfer Capacity of Noisy Correlations. In: Proc. ISIT 2006, pp. 1871\u20131875. IEEE, Los Alamitos (2006)"},{"key":"16_CR20","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Memo TR\u201381, Aiken Computation Laboratory, Harvard University (1981)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11593447_11","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"R. Renner","year":"2005","unstructured":"Renner, R., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 199\u2013216. Springer, Heidelberg (2005)"},{"key":"16_CR22","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Chichester (1991)"},{"key":"16_CR23","first-page":"293","volume-title":"Proc. ISIT 2002 (Lausanne)","author":"D. Stebila","year":"2002","unstructured":"Stebila, D., Wolf, S.: Efficient oblivious transfer from any non-trivial binary-symmetric channel. In: Proc. ISIT 2002 (Lausanne), p. 293. IEEE, Los Alamitos (2002)"},{"issue":"1","key":"16_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S. Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. Sigact News\u00a015(1), 78\u201388 (1983); original manuscript written ca (1970)","journal-title":"Sigact News"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-40974-8_4","volume-title":"Cryptography and Coding","author":"A. Winter","year":"2003","unstructured":"Winter, A., Nascimento, A.C.A., Imai, H.: Commitment Capacity of Discrete Memoryless Channels. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol.\u00a02898, pp. 35\u201351. Springer, Heidelberg (2003)"},{"key":"16_CR26","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)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11761679_14","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S. Wolf","year":"2006","unstructured":"Wolf, S., Wullschleger, J.: Oblivious transfer is symmetric. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 222\u2013232. Springer, Heidelberg (2006)"},{"key":"16_CR28","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"A. Wyner","year":"1975","unstructured":"Wyner, A.: The Wire Tap Channel. Bell System Tech. J.\u00a054, 1355\u20131387 (1975)","journal-title":"Bell System Tech. J."}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10230-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:52:26Z","timestamp":1606186346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10230-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102295","9783642102301"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10230-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}