{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:23:48Z","timestamp":1726410228160},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_38","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"461-472","source":"Crossref","is-referenced-by-count":7,"title":["Error-Tolerant Combiners for Oblivious Primitives"],"prefix":"10.1007","author":[{"given":"Bartosz","family":"Przydatek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrg","family":"Wullschleger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/0898-1221(81)90029-8","volume":"7","author":"C. Asmuth","year":"1981","unstructured":"Asmuth, C., Blakely, G.: An effcient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems. Computers and Mathematics with Applications\u00a07, 447\u2013450 (1981)","journal-title":"Computers and Mathematics with Applications"},{"key":"38_CR2","first-page":"633","volume":"4","author":"E.R. Berlekamp","year":"1986","unstructured":"Berlekamp, E.R., Welch, L.R.: Error correction for algebraic block codes, U.S. Patent 4 633 470 (1986)","journal-title":"U.S. Patent"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference. American Federation of Information Processing Societies, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"38_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 flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 350\u2013354. Springer, Heidelberg (1988)"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: Proc.\u00a0IEEE FOCS 1988, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-46416-6_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"C. Cr\u00e9peau","year":"1991","unstructured":"Cr\u00e9peau, C., S\u00e1ntha, M.: On the reversibility of oblivious transfer. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 106\u2013113. Springer, Heidelberg (1991)"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"I. Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 56\u201373. Springer, Heidelberg (1999)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-540-30576-7_11","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Katz, J.: Chosen-ciphertext security of multiple encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 188\u2013209. Springer, Heidelberg (2005)"},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/214438.214442","volume":"3","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O.: On the power of cascade ciphers. ACM Trans. Comput. Syst.\u00a03(2), 108\u2013116 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"6","key":"38_CR10","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"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game \u2014 a completeness theorem for protocols with honest majority. In: Proc.\u00a019th ACM STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Proc.\u00a0TCC 2008","author":"D. Harnik","year":"2008","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Proc.\u00a0TCC 2008. LNCS, Springer, Heidelberg (2008)"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 robust combiners for oblivious transfer and other primitives. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 96\u2013113. Springer, Heidelberg (2005)"},{"key":"38_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-30574-3_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"A. Herzberg","year":"2005","unstructured":"Herzberg, A.: On tolerant cryptographic constructions. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 172\u2013190. Springer, Heidelberg (2005)"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/978-3-540-30576-7_15","volume-title":"Theory of Cryptography","author":"S. Hohenberger","year":"2005","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 264\u2013282. Springer, Heidelberg (2005)"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proc.\u00a020th ACM STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"issue":"1","key":"38_CR17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02620231","volume":"6","author":"U. Maurer","year":"1993","unstructured":"Maurer, U., Massey, J.L.: Cascade ciphers: The importance of being first. Journal of Cryptology\u00a06(1), 55\u201361 (1993). Preliminary version. In: Proc.\u00a0IEEE Symposium on Information Theory (1990)","journal-title":"Journal of Cryptology"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/11818175_33","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"R. Meier","year":"2006","unstructured":"Meier, R., Przydatek, B.: On robust combiners for private information retrieval and other primitives. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 555\u2013569. Springer, Heidelberg (2006)"},{"key":"38_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-540-70936-7_22","volume-title":"Theory of Cryptography","author":"R. Meier","year":"2007","unstructured":"Meier, R., Przydatek, B., Wullschleger, J.: Robuster combiners for oblivious transfer. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 404\u2013418. Springer, Heidelberg (2007)"},{"issue":"5","key":"38_CR20","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M. Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput.\u00a035(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Fair games against an all-powerful adversary. In: Advances in Computational Complexity Theory. AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a013, pp. 155\u2013169. AMS (1993)","DOI":"10.1090\/dimacs\/013\/09"},{"key":"38_CR22","unstructured":"Przydatek, B., Wullschleger, J.: Error-tolerant combiners for oblivious primitives, full version of this paper, Cryptology ePrint Archive, eprint.iacr.org (2008)"},{"key":"38_CR23","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory (1981), eprint.iacr.org\/2005\/187"},{"key":"38_CR24","unstructured":"Rivest, R.L.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer (unpublished manuscript) (1999)"},{"issue":"11","key":"38_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"38_CR26","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":"38_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515. Springer, Heidelberg (2007), arxiv.org\/abs\/cs.CR\/0608076"},{"key":"38_CR28","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: Proc.\u00a027th IEEE FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:00Z","timestamp":1605762480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}